./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-p_file-97.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 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:02:30,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:02:30,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:02:30,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:02:30,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:02:30,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:02:30,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:02:30,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:02:30,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:02:30,796 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:02:30,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:02:30,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:02:30,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:02:30,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:02:30,798 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:02:30,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:02:30,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:02:30,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:02:30,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:02:30,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:02:30,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:02:30,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:02:30,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:02:30,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:02:30,801 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:02:30,801 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:02:30,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:02:30,802 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:02:30,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:02:30,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:02:30,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:02:30,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:02:30,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:02:30,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:02:30,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:02:30,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:02:30,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:02:30,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:02:30,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:02:30,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:02:30,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:02:30,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:02:30,807 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 -> 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b [2024-11-19 01:02:31,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:02:31,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:02:31,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:02:31,088 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:02:31,089 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:02:31,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-11-19 01:02:32,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:02:32,780 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:02:32,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-11-19 01:02:32,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7ccb3f6/a82824e5dc7c4f27bf4fa111a4127a0d/FLAGcb46a73ed [2024-11-19 01:02:32,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7ccb3f6/a82824e5dc7c4f27bf4fa111a4127a0d [2024-11-19 01:02:32,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:02:32,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:02:32,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:02:32,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:02:32,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:02:32,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:02:32" (1/1) ... [2024-11-19 01:02:32,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b0f248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:32, skipping insertion in model container [2024-11-19 01:02:32,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:02:32" (1/1) ... [2024-11-19 01:02:32,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:02:33,040 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-p_file-97.i[916,929] [2024-11-19 01:02:33,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:02:33,138 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:02:33,155 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-p_file-97.i[916,929] [2024-11-19 01:02:33,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:02:33,205 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:02:33,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33 WrapperNode [2024-11-19 01:02:33,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:02:33,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:02:33,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:02:33,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:02:33,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33" (1/1) ... [2024-11-19 01:02:33,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33" (1/1) ... [2024-11-19 01:02:33,330 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2024-11-19 01:02:33,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:02:33,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:02:33,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:02:33,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:02:33,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33" (1/1) ... [2024-11-19 01:02:33,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33" (1/1) ... [2024-11-19 01:02:33,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33" (1/1) ... [2024-11-19 01:02:33,407 INFO L175 MemorySlicer]: Split 116 memory accesses to 16 slices as follows [2, 7, 8, 6, 6, 7, 8, 10, 11, 8, 6, 7, 6, 9, 8, 7]. 9 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-11-19 01:02:33,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33" (1/1) ... [2024-11-19 01:02:33,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33" (1/1) ... [2024-11-19 01:02:33,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33" (1/1) ... [2024-11-19 01:02:33,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33" (1/1) ... [2024-11-19 01:02:33,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33" (1/1) ... [2024-11-19 01:02:33,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33" (1/1) ... [2024-11-19 01:02:33,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:02:33,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:02:33,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:02:33,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:02:33,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33" (1/1) ... [2024-11-19 01:02:33,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:02:33,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:02:33,492 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-19 01:02:33,499 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-19 01:02:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:02:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 01:02:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 01:02:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 01:02:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 01:02:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 01:02:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 01:02:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-19 01:02:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-19 01:02:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-19 01:02:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-19 01:02:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-19 01:02:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-19 01:02:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-19 01:02:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-19 01:02:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-19 01:02:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-11-19 01:02:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 01:02:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 01:02:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 01:02:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 01:02:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 01:02:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 01:02:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 01:02:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-19 01:02:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-19 01:02:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-19 01:02:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-19 01:02:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-19 01:02:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-19 01:02:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-19 01:02:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-19 01:02:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-19 01:02:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 01:02:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 01:02:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 01:02:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 01:02:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 01:02:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 01:02:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-19 01:02:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-19 01:02:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-19 01:02:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-19 01:02:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-19 01:02:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-19 01:02:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-19 01:02:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-19 01:02:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-19 01:02:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-11-19 01:02:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 01:02:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 01:02:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 01:02:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 01:02:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 01:02:33,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 01:02:33,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 01:02:33,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-19 01:02:33,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-19 01:02:33,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-19 01:02:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-19 01:02:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-19 01:02:33,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-19 01:02:33,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-19 01:02:33,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-19 01:02:33,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-19 01:02:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 01:02:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 01:02:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 01:02:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 01:02:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 01:02:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 01:02:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-19 01:02:33,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-19 01:02:33,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-19 01:02:33,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-19 01:02:33,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-19 01:02:33,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-19 01:02:33,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-19 01:02:33,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-19 01:02:33,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-19 01:02:33,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-11-19 01:02:33,570 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:02:33,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:02:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:02:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 01:02:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 01:02:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 01:02:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 01:02:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 01:02:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 01:02:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 01:02:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 01:02:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 01:02:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 01:02:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 01:02:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 01:02:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-19 01:02:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-19 01:02:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-19 01:02:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:02:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:02:33,807 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:02:33,809 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:02:34,348 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-19 01:02:34,348 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:02:34,366 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:02:34,368 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:02:34,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:02:34 BoogieIcfgContainer [2024-11-19 01:02:34,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:02:34,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:02:34,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:02:34,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:02:34,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:02:32" (1/3) ... [2024-11-19 01:02:34,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648366af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:02:34, skipping insertion in model container [2024-11-19 01:02:34,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:33" (2/3) ... [2024-11-19 01:02:34,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648366af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:02:34, skipping insertion in model container [2024-11-19 01:02:34,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:02:34" (3/3) ... [2024-11-19 01:02:34,380 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-97.i [2024-11-19 01:02:34,401 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:02:34,402 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:02:34,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:02:34,498 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;@48320f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:02:34,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:02:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 89 states have internal predecessors, (123), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:02:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:02:34,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:34,522 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:34,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:34,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:34,530 INFO L85 PathProgramCache]: Analyzing trace with hash 414475226, now seen corresponding path program 1 times [2024-11-19 01:02:34,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:34,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613366486] [2024-11-19 01:02:34,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:34,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-19 01:02:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613366486] [2024-11-19 01:02:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613366486] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:34,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532345840] [2024-11-19 01:02:34,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:34,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:34,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:02:34,982 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-19 01:02:34,983 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-19 01:02:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:35,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:02:35,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-19 01:02:35,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:35,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532345840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:35,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:35,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:02:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677808073] [2024-11-19 01:02:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:35,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:02:35,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:35,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:02:35,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:02:35,311 INFO L87 Difference]: Start difference. First operand has 108 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 89 states have internal predecessors, (123), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:02:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:35,352 INFO L93 Difference]: Finished difference Result 209 states and 325 transitions. [2024-11-19 01:02:35,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:02:35,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-11-19 01:02:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:35,362 INFO L225 Difference]: With dead ends: 209 [2024-11-19 01:02:35,362 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 01:02:35,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-19 01:02:35,370 INFO L432 NwaCegarLoop]: 150 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, 150 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-19 01:02:35,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 01:02:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-19 01:02:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:02:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2024-11-19 01:02:35,427 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 134 [2024-11-19 01:02:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:35,429 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2024-11-19 01:02:35,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:02:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2024-11-19 01:02:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:02:35,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:35,433 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:35,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:35,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 01:02:35,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:35,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:35,635 INFO L85 PathProgramCache]: Analyzing trace with hash 560492216, now seen corresponding path program 1 times [2024-11-19 01:02:35,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:35,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665875753] [2024-11-19 01:02:35,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:35,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:36,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:36,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665875753] [2024-11-19 01:02:36,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665875753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:36,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329238926] [2024-11-19 01:02:36,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:36,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:36,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:02:36,153 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-19 01:02:36,154 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-19 01:02:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:36,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:02:36,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:36,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:36,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329238926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:36,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:36,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 01:02:36,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472046463] [2024-11-19 01:02:36,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:36,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:02:36,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:36,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:02:36,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:02:36,539 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:36,588 INFO L93 Difference]: Finished difference Result 208 states and 301 transitions. [2024-11-19 01:02:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:02:36,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-11-19 01:02:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:36,596 INFO L225 Difference]: With dead ends: 208 [2024-11-19 01:02:36,598 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 01:02:36,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:02:36,600 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:36,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 430 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 01:02:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-19 01:02:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:02:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2024-11-19 01:02:36,620 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 134 [2024-11-19 01:02:36,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:36,624 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2024-11-19 01:02:36,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2024-11-19 01:02:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:02:36,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:36,627 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:36,646 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-19 01:02:36,827 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,SelfDestructingSolverStorable1 [2024-11-19 01:02:36,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:36,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:36,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1240550586, now seen corresponding path program 1 times [2024-11-19 01:02:36,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:36,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355536674] [2024-11-19 01:02:36,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:36,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:37,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355536674] [2024-11-19 01:02:37,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355536674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123947196] [2024-11-19 01:02:37,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:37,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:37,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:02:37,145 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:02:37,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:02:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:37,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:02:37,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:37,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123947196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:37,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:37,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 01:02:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336077627] [2024-11-19 01:02:37,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:37,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:02:37,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:37,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:02:37,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:02:37,442 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:37,491 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2024-11-19 01:02:37,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:02:37,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-11-19 01:02:37,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:37,494 INFO L225 Difference]: With dead ends: 212 [2024-11-19 01:02:37,494 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 01:02:37,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:02:37,496 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:37,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 431 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 01:02:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-19 01:02:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:02:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-11-19 01:02:37,517 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 134 [2024-11-19 01:02:37,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:37,518 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-11-19 01:02:37,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-11-19 01:02:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:02:37,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:37,525 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:37,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:37,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:37,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:37,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1279409348, now seen corresponding path program 1 times [2024-11-19 01:02:37,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:37,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222173794] [2024-11-19 01:02:37,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:37,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:37,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:37,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222173794] [2024-11-19 01:02:37,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222173794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:37,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333083998] [2024-11-19 01:02:37,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:37,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:37,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:02:37,949 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:02:37,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 01:02:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:38,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:02:38,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:38,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:38,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333083998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:38,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:38,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 01:02:38,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217454225] [2024-11-19 01:02:38,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:38,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:02:38,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:38,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:02:38,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:02:38,239 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:38,267 INFO L93 Difference]: Finished difference Result 216 states and 309 transitions. [2024-11-19 01:02:38,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:02:38,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-11-19 01:02:38,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:38,270 INFO L225 Difference]: With dead ends: 216 [2024-11-19 01:02:38,270 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 01:02:38,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:02:38,271 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:38,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:38,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 01:02:38,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-19 01:02:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:02:38,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2024-11-19 01:02:38,287 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 134 [2024-11-19 01:02:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:38,289 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2024-11-19 01:02:38,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2024-11-19 01:02:38,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:02:38,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:38,293 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:38,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:38,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:38,494 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:38,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:38,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1277562306, now seen corresponding path program 1 times [2024-11-19 01:02:38,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:38,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527711702] [2024-11-19 01:02:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:38,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:38,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:38,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527711702] [2024-11-19 01:02:38,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527711702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:38,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917713119] [2024-11-19 01:02:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:38,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:38,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:02:38,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:02:38,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 01:02:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:38,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:02:38,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:38,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:38,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917713119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:38,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:38,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 01:02:38,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430108406] [2024-11-19 01:02:38,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:38,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:02:38,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:38,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:02:38,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:02:38,992 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:39,013 INFO L93 Difference]: Finished difference Result 219 states and 312 transitions. [2024-11-19 01:02:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:02:39,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-11-19 01:02:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:39,015 INFO L225 Difference]: With dead ends: 219 [2024-11-19 01:02:39,015 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 01:02:39,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:02:39,016 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:39,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 01:02:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 01:02:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:02:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-11-19 01:02:39,024 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 134 [2024-11-19 01:02:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:39,024 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-11-19 01:02:39,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-11-19 01:02:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 01:02:39,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:39,026 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:39,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 01:02:39,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:39,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:39,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2067265744, now seen corresponding path program 1 times [2024-11-19 01:02:39,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:39,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171470405] [2024-11-19 01:02:39,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:39,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:39,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:39,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171470405] [2024-11-19 01:02:39,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171470405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:39,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:39,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:02:39,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686842142] [2024-11-19 01:02:39,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:39,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:39,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:39,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:39,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:02:39,862 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:40,103 INFO L93 Difference]: Finished difference Result 312 states and 439 transitions. [2024-11-19 01:02:40,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:02:40,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-19 01:02:40,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:40,105 INFO L225 Difference]: With dead ends: 312 [2024-11-19 01:02:40,105 INFO L226 Difference]: Without dead ends: 203 [2024-11-19 01:02:40,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:02:40,107 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 307 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:40,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 653 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:02:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-19 01:02:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 114. [2024-11-19 01:02:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:02:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-11-19 01:02:40,117 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 136 [2024-11-19 01:02:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:40,118 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-11-19 01:02:40,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-11-19 01:02:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 01:02:40,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:40,119 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:40,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:02:40,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:40,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:40,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1301438311, now seen corresponding path program 1 times [2024-11-19 01:02:40,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:40,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750496447] [2024-11-19 01:02:40,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:40,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:40,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:40,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750496447] [2024-11-19 01:02:40,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750496447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:40,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756309754] [2024-11-19 01:02:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:40,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:40,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:02:40,923 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:02:40,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 01:02:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:41,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 01:02:41,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:41,602 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-19 01:02:41,723 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-19 01:02:41,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 01:02:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 4 proven. 252 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-19 01:02:41,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:41,821 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 24 treesize of output 20 [2024-11-19 01:02:41,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:02:41,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 36 [2024-11-19 01:02:42,036 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 36 treesize of output 32 [2024-11-19 01:02:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:42,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756309754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:02:42,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:02:42,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2024-11-19 01:02:42,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691395982] [2024-11-19 01:02:42,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:02:42,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 01:02:42,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:42,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 01:02:42,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:02:42,204 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 18 states, 15 states have (on average 5.066666666666666) internal successors, (76), 17 states have internal predecessors, (76), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) [2024-11-19 01:02:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:43,049 INFO L93 Difference]: Finished difference Result 348 states and 484 transitions. [2024-11-19 01:02:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 01:02:43,050 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 5.066666666666666) internal successors, (76), 17 states have internal predecessors, (76), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) Word has length 136 [2024-11-19 01:02:43,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:43,054 INFO L225 Difference]: With dead ends: 348 [2024-11-19 01:02:43,054 INFO L226 Difference]: Without dead ends: 237 [2024-11-19 01:02:43,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 265 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=288, Invalid=1118, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 01:02:43,058 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 713 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:43,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1186 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:02:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-19 01:02:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 129. [2024-11-19 01:02:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 109 states have (on average 1.3302752293577982) internal successors, (145), 109 states have internal predecessors, (145), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:02:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2024-11-19 01:02:43,078 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 136 [2024-11-19 01:02:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:43,079 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2024-11-19 01:02:43,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 5.066666666666666) internal successors, (76), 17 states have internal predecessors, (76), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) [2024-11-19 01:02:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2024-11-19 01:02:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 01:02:43,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:43,081 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:43,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:43,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:43,284 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:43,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:43,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1435451817, now seen corresponding path program 1 times [2024-11-19 01:02:43,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:43,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668974046] [2024-11-19 01:02:43,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:43,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:43,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:43,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668974046] [2024-11-19 01:02:43,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668974046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:43,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229028068] [2024-11-19 01:02:43,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:43,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:43,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:02:43,784 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:02:43,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 01:02:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:44,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 01:02:44,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:44,292 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-19 01:02:44,422 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-19 01:02:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 298 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-19 01:02:44,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:44,598 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 36 treesize of output 32 [2024-11-19 01:02:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:44,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229028068] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:02:44,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:02:44,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2024-11-19 01:02:44,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080884737] [2024-11-19 01:02:44,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:02:44,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 01:02:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:44,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 01:02:44,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:02:44,717 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand has 13 states, 10 states have (on average 6.9) internal successors, (69), 12 states have internal predecessors, (69), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) [2024-11-19 01:02:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:45,149 INFO L93 Difference]: Finished difference Result 282 states and 391 transitions. [2024-11-19 01:02:45,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:02:45,149 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 6.9) internal successors, (69), 12 states have internal predecessors, (69), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) Word has length 136 [2024-11-19 01:02:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:45,151 INFO L225 Difference]: With dead ends: 282 [2024-11-19 01:02:45,151 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 01:02:45,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 267 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2024-11-19 01:02:45,152 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 210 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:45,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 757 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:02:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 01:02:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2024-11-19 01:02:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 123 states have internal predecessors, (157), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 01:02:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 211 transitions. [2024-11-19 01:02:45,173 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 211 transitions. Word has length 136 [2024-11-19 01:02:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:45,175 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 211 transitions. [2024-11-19 01:02:45,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 6.9) internal successors, (69), 12 states have internal predecessors, (69), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) [2024-11-19 01:02:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 211 transitions. [2024-11-19 01:02:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 01:02:45,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:45,177 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:45,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:45,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:45,381 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:45,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:45,381 INFO L85 PathProgramCache]: Analyzing trace with hash -940581760, now seen corresponding path program 1 times [2024-11-19 01:02:45,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:45,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809205699] [2024-11-19 01:02:45,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:46,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:46,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809205699] [2024-11-19 01:02:46,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809205699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414475590] [2024-11-19 01:02:46,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:46,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:46,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:02:46,053 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:02:46,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 01:02:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:46,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 01:02:46,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:46,461 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-19 01:02:46,593 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 217 treesize of output 177 [2024-11-19 01:02:46,606 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 177 treesize of output 137 [2024-11-19 01:02:46,610 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 137 treesize of output 113 [2024-11-19 01:02:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:46,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:46,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414475590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:46,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:46,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-19 01:02:46,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374600933] [2024-11-19 01:02:46,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:46,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:46,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:46,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:46,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:02:46,659 INFO L87 Difference]: Start difference. First operand 153 states and 211 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:46,860 INFO L93 Difference]: Finished difference Result 357 states and 488 transitions. [2024-11-19 01:02:46,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:02:46,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-19 01:02:46,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:46,864 INFO L225 Difference]: With dead ends: 357 [2024-11-19 01:02:46,864 INFO L226 Difference]: Without dead ends: 228 [2024-11-19 01:02:46,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:02:46,865 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 80 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:46,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 766 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:02:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-19 01:02:46,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2024-11-19 01:02:46,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 187 states have (on average 1.2941176470588236) internal successors, (242), 189 states have internal predecessors, (242), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 01:02:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 308 transitions. [2024-11-19 01:02:46,892 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 308 transitions. Word has length 136 [2024-11-19 01:02:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:46,893 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 308 transitions. [2024-11-19 01:02:46,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 308 transitions. [2024-11-19 01:02:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 01:02:46,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:46,895 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:46,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 01:02:47,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-19 01:02:47,096 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:47,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:47,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1558728417, now seen corresponding path program 1 times [2024-11-19 01:02:47,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:47,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346298746] [2024-11-19 01:02:47,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:47,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:47,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:47,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346298746] [2024-11-19 01:02:47,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346298746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:47,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:47,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:02:47,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958611509] [2024-11-19 01:02:47,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:47,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:47,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:47,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:47,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:02:47,351 INFO L87 Difference]: Start difference. First operand 225 states and 308 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:47,464 INFO L93 Difference]: Finished difference Result 633 states and 864 transitions. [2024-11-19 01:02:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:02:47,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-11-19 01:02:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:47,469 INFO L225 Difference]: With dead ends: 633 [2024-11-19 01:02:47,470 INFO L226 Difference]: Without dead ends: 432 [2024-11-19 01:02:47,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-19 01:02:47,471 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 144 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:47,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1221 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:02:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-19 01:02:47,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 408. [2024-11-19 01:02:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 343 states have (on average 1.2944606413994169) internal successors, (444), 346 states have internal predecessors, (444), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-19 01:02:47,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 556 transitions. [2024-11-19 01:02:47,535 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 556 transitions. Word has length 137 [2024-11-19 01:02:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:47,536 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 556 transitions. [2024-11-19 01:02:47,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 556 transitions. [2024-11-19 01:02:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 01:02:47,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:47,538 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:47,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:02:47,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:47,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:47,539 INFO L85 PathProgramCache]: Analyzing trace with hash 448387173, now seen corresponding path program 1 times [2024-11-19 01:02:47,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:47,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757137891] [2024-11-19 01:02:47,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:47,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:47,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:47,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757137891] [2024-11-19 01:02:47,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757137891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:47,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:47,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:02:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20460132] [2024-11-19 01:02:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:47,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:02:47,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:47,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:02:47,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:02:47,747 INFO L87 Difference]: Start difference. First operand 408 states and 556 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:47,915 INFO L93 Difference]: Finished difference Result 940 states and 1273 transitions. [2024-11-19 01:02:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:02:47,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-11-19 01:02:47,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:47,919 INFO L225 Difference]: With dead ends: 940 [2024-11-19 01:02:47,919 INFO L226 Difference]: Without dead ends: 556 [2024-11-19 01:02:47,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:02:47,921 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 117 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:47,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 852 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:02:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-19 01:02:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 552. [2024-11-19 01:02:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 460 states have (on average 1.2782608695652173) internal successors, (588), 465 states have internal predecessors, (588), 79 states have call successors, (79), 12 states have call predecessors, (79), 12 states have return successors, (79), 74 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 01:02:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 746 transitions. [2024-11-19 01:02:47,977 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 746 transitions. Word has length 138 [2024-11-19 01:02:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:47,977 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 746 transitions. [2024-11-19 01:02:47,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 746 transitions. [2024-11-19 01:02:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 01:02:47,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:47,980 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:47,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:02:47,980 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:47,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1803569688, now seen corresponding path program 1 times [2024-11-19 01:02:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:47,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316917878] [2024-11-19 01:02:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:48,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:48,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316917878] [2024-11-19 01:02:48,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316917878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:48,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:48,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:02:48,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001325114] [2024-11-19 01:02:48,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:48,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:02:48,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:48,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:02:48,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:02:48,196 INFO L87 Difference]: Start difference. First operand 552 states and 746 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:48,358 INFO L93 Difference]: Finished difference Result 1251 states and 1679 transitions. [2024-11-19 01:02:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:02:48,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-19 01:02:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:48,363 INFO L225 Difference]: With dead ends: 1251 [2024-11-19 01:02:48,363 INFO L226 Difference]: Without dead ends: 723 [2024-11-19 01:02:48,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:02:48,365 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 114 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:48,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 639 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:02:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-19 01:02:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 264. [2024-11-19 01:02:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 216 states have (on average 1.2685185185185186) internal successors, (274), 218 states have internal predecessors, (274), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:02:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 354 transitions. [2024-11-19 01:02:48,401 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 354 transitions. Word has length 139 [2024-11-19 01:02:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:48,402 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 354 transitions. [2024-11-19 01:02:48,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 354 transitions. [2024-11-19 01:02:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 01:02:48,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:48,403 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:48,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:02:48,404 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:48,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:48,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1390692475, now seen corresponding path program 1 times [2024-11-19 01:02:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:48,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020502938] [2024-11-19 01:02:48,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:48,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:49,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:49,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020502938] [2024-11-19 01:02:49,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020502938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:49,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690960512] [2024-11-19 01:02:49,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:49,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:49,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:02:49,017 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:02:49,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 01:02:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:49,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 01:02:49,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:49,525 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-19 01:02:49,616 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 25 treesize of output 17 [2024-11-19 01:02:49,621 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-19 01:02:49,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 01:02:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-19 01:02:49,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:49,798 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 32 treesize of output 28 [2024-11-19 01:02:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:49,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690960512] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:49,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:02:49,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 5] total 19 [2024-11-19 01:02:49,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505043835] [2024-11-19 01:02:49,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:49,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:49,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:49,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2024-11-19 01:02:49,894 INFO L87 Difference]: Start difference. First operand 264 states and 354 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:02:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:50,082 INFO L93 Difference]: Finished difference Result 473 states and 636 transitions. [2024-11-19 01:02:50,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:02:50,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2024-11-19 01:02:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:50,087 INFO L225 Difference]: With dead ends: 473 [2024-11-19 01:02:50,087 INFO L226 Difference]: Without dead ends: 264 [2024-11-19 01:02:50,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2024-11-19 01:02:50,089 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 312 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:50,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 261 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:02:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-19 01:02:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-19 01:02:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 216 states have (on average 1.2592592592592593) internal successors, (272), 218 states have internal predecessors, (272), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:02:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 352 transitions. [2024-11-19 01:02:50,123 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 352 transitions. Word has length 139 [2024-11-19 01:02:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:50,123 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 352 transitions. [2024-11-19 01:02:50,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:02:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 352 transitions. [2024-11-19 01:02:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 01:02:50,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:50,125 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:50,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:50,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 01:02:50,326 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:50,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:50,326 INFO L85 PathProgramCache]: Analyzing trace with hash 605351532, now seen corresponding path program 1 times [2024-11-19 01:02:50,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:50,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199833250] [2024-11-19 01:02:50,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:50,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:50,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:50,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199833250] [2024-11-19 01:02:50,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199833250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:50,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:50,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:02:50,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586195712] [2024-11-19 01:02:50,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:50,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:50,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:50,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:50,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:02:50,691 INFO L87 Difference]: Start difference. First operand 264 states and 352 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:50,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:50,925 INFO L93 Difference]: Finished difference Result 626 states and 834 transitions. [2024-11-19 01:02:50,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:02:50,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-19 01:02:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:50,930 INFO L225 Difference]: With dead ends: 626 [2024-11-19 01:02:50,930 INFO L226 Difference]: Without dead ends: 417 [2024-11-19 01:02:50,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:02:50,931 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 312 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:50,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 540 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:02:50,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-19 01:02:50,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 264. [2024-11-19 01:02:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 216 states have (on average 1.25) internal successors, (270), 218 states have internal predecessors, (270), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:02:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 350 transitions. [2024-11-19 01:02:50,966 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 350 transitions. Word has length 140 [2024-11-19 01:02:50,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:50,966 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 350 transitions. [2024-11-19 01:02:50,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:50,967 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 350 transitions. [2024-11-19 01:02:50,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 01:02:50,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:50,968 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:50,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 01:02:50,969 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:50,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:50,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2101267862, now seen corresponding path program 1 times [2024-11-19 01:02:50,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:50,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24839159] [2024-11-19 01:02:50,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:50,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:51,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:51,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24839159] [2024-11-19 01:02:51,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24839159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:02:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487653668] [2024-11-19 01:02:51,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:51,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:02:51,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:51,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:02:51,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:02:51,717 INFO L87 Difference]: Start difference. First operand 264 states and 350 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:51,890 INFO L93 Difference]: Finished difference Result 574 states and 758 transitions. [2024-11-19 01:02:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:02:51,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-19 01:02:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:51,892 INFO L225 Difference]: With dead ends: 574 [2024-11-19 01:02:51,893 INFO L226 Difference]: Without dead ends: 365 [2024-11-19 01:02:51,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-19 01:02:51,894 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 49 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:51,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1043 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:02:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-19 01:02:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 274. [2024-11-19 01:02:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 226 states have (on average 1.247787610619469) internal successors, (282), 228 states have internal predecessors, (282), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:02:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 362 transitions. [2024-11-19 01:02:51,931 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 362 transitions. Word has length 140 [2024-11-19 01:02:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:51,931 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 362 transitions. [2024-11-19 01:02:51,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 362 transitions. [2024-11-19 01:02:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 01:02:51,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:51,934 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:51,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 01:02:51,934 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:51,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:51,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1678566036, now seen corresponding path program 1 times [2024-11-19 01:02:51,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:51,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084760608] [2024-11-19 01:02:51,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:51,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:52,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:52,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084760608] [2024-11-19 01:02:52,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084760608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:52,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:52,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:02:52,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092298069] [2024-11-19 01:02:52,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:52,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:52,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:52,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:52,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:02:52,298 INFO L87 Difference]: Start difference. First operand 274 states and 362 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:52,522 INFO L93 Difference]: Finished difference Result 630 states and 834 transitions. [2024-11-19 01:02:52,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:02:52,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-19 01:02:52,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:52,526 INFO L225 Difference]: With dead ends: 630 [2024-11-19 01:02:52,526 INFO L226 Difference]: Without dead ends: 411 [2024-11-19 01:02:52,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:02:52,527 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 254 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:52,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 574 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:02:52,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-19 01:02:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 258. [2024-11-19 01:02:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 210 states have (on average 1.2380952380952381) internal successors, (260), 212 states have internal predecessors, (260), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:02:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 340 transitions. [2024-11-19 01:02:52,562 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 340 transitions. Word has length 140 [2024-11-19 01:02:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:52,563 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 340 transitions. [2024-11-19 01:02:52,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 340 transitions. [2024-11-19 01:02:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 01:02:52,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:52,566 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:52,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 01:02:52,566 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:52,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:52,567 INFO L85 PathProgramCache]: Analyzing trace with hash 298762568, now seen corresponding path program 1 times [2024-11-19 01:02:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:52,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133371218] [2024-11-19 01:02:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:52,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:52,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:52,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133371218] [2024-11-19 01:02:52,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133371218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:52,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:52,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:02:52,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749528687] [2024-11-19 01:02:52,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:52,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:52,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:52,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:52,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:02:52,912 INFO L87 Difference]: Start difference. First operand 258 states and 340 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:53,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:53,006 INFO L93 Difference]: Finished difference Result 270 states and 352 transitions. [2024-11-19 01:02:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:02:53,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-19 01:02:53,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:53,009 INFO L225 Difference]: With dead ends: 270 [2024-11-19 01:02:53,009 INFO L226 Difference]: Without dead ends: 268 [2024-11-19 01:02:53,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-19 01:02:53,009 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 84 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:53,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 702 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-19 01:02:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-19 01:02:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 219 states have (on average 1.2283105022831051) internal successors, (269), 221 states have internal predecessors, (269), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:02:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 349 transitions. [2024-11-19 01:02:53,045 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 349 transitions. Word has length 140 [2024-11-19 01:02:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:53,046 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 349 transitions. [2024-11-19 01:02:53,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 349 transitions. [2024-11-19 01:02:53,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 01:02:53,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:53,047 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:53,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 01:02:53,048 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:53,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash 300609610, now seen corresponding path program 1 times [2024-11-19 01:02:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:53,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323549628] [2024-11-19 01:02:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:53,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:53,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323549628] [2024-11-19 01:02:53,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323549628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:53,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641825074] [2024-11-19 01:02:53,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:53,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:53,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:02:53,604 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:02:53,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 01:02:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:53,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 01:02:53,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:53,942 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-19 01:02:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:54,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641825074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:54,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2024-11-19 01:02:54,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014655271] [2024-11-19 01:02:54,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:54,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:02:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:54,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:02:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2024-11-19 01:02:54,081 INFO L87 Difference]: Start difference. First operand 268 states and 349 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:54,430 INFO L93 Difference]: Finished difference Result 652 states and 847 transitions. [2024-11-19 01:02:54,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:02:54,431 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-19 01:02:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:54,434 INFO L225 Difference]: With dead ends: 652 [2024-11-19 01:02:54,434 INFO L226 Difference]: Without dead ends: 439 [2024-11-19 01:02:54,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2024-11-19 01:02:54,435 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 253 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:54,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1202 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:02:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-19 01:02:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 307. [2024-11-19 01:02:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 258 states have (on average 1.255813953488372) internal successors, (324), 260 states have internal predecessors, (324), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:02:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 404 transitions. [2024-11-19 01:02:54,472 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 404 transitions. Word has length 140 [2024-11-19 01:02:54,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:54,473 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 404 transitions. [2024-11-19 01:02:54,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-11-19 01:02:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 01:02:54,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:54,475 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:54,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 01:02:54,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 01:02:54,676 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:54,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:54,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1539291954, now seen corresponding path program 1 times [2024-11-19 01:02:54,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:54,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954108219] [2024-11-19 01:02:54,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:55,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:55,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954108219] [2024-11-19 01:02:55,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954108219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:55,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629100575] [2024-11-19 01:02:55,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:55,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:55,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:02:55,283 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:02:55,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 01:02:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:55,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 01:02:55,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:55,917 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-19 01:02:56,062 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-19 01:02:56,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 01:02:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 298 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-19 01:02:56,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:56,551 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 36 treesize of output 32 [2024-11-19 01:02:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:56,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629100575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:02:56,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:02:56,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 29 [2024-11-19 01:02:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069767630] [2024-11-19 01:02:56,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:02:56,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 01:02:56,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:56,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 01:02:56,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2024-11-19 01:02:56,669 INFO L87 Difference]: Start difference. First operand 307 states and 404 transitions. Second operand has 29 states, 25 states have (on average 4.24) internal successors, (106), 28 states have internal predecessors, (106), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-11-19 01:02:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:58,238 INFO L93 Difference]: Finished difference Result 717 states and 934 transitions. [2024-11-19 01:02:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-19 01:02:58,239 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.24) internal successors, (106), 28 states have internal predecessors, (106), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) Word has length 140 [2024-11-19 01:02:58,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:58,242 INFO L225 Difference]: With dead ends: 717 [2024-11-19 01:02:58,242 INFO L226 Difference]: Without dead ends: 465 [2024-11-19 01:02:58,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 263 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=493, Invalid=2813, Unknown=0, NotChecked=0, Total=3306 [2024-11-19 01:02:58,244 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 555 mSDsluCounter, 2918 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:58,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 3133 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:02:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-19 01:02:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 329. [2024-11-19 01:02:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 280 states have (on average 1.25) internal successors, (350), 282 states have internal predecessors, (350), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:02:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 430 transitions. [2024-11-19 01:02:58,279 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 430 transitions. Word has length 140 [2024-11-19 01:02:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:58,280 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 430 transitions. [2024-11-19 01:02:58,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.24) internal successors, (106), 28 states have internal predecessors, (106), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-11-19 01:02:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 430 transitions. [2024-11-19 01:02:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 01:02:58,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:58,281 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:58,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 01:02:58,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:02:58,486 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:58,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:58,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2016680588, now seen corresponding path program 1 times [2024-11-19 01:02:58,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:58,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411994206] [2024-11-19 01:02:58,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:58,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:58,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:02:58,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411994206] [2024-11-19 01:02:58,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411994206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:58,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:58,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:02:58,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714603813] [2024-11-19 01:02:58,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:58,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:58,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:02:58,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:58,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:02:58,835 INFO L87 Difference]: Start difference. First operand 329 states and 430 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:59,006 INFO L93 Difference]: Finished difference Result 603 states and 788 transitions. [2024-11-19 01:02:59,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:02:59,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-11-19 01:02:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:59,009 INFO L225 Difference]: With dead ends: 603 [2024-11-19 01:02:59,009 INFO L226 Difference]: Without dead ends: 329 [2024-11-19 01:02:59,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:02:59,011 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 227 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:59,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 366 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:02:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-19 01:02:59,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2024-11-19 01:02:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 280 states have (on average 1.2214285714285715) internal successors, (342), 282 states have internal predecessors, (342), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:02:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 422 transitions. [2024-11-19 01:02:59,047 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 422 transitions. Word has length 141 [2024-11-19 01:02:59,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:59,047 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 422 transitions. [2024-11-19 01:02:59,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:59,048 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 422 transitions. [2024-11-19 01:02:59,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 01:02:59,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:59,049 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:02:59,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 01:02:59,049 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:59,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:59,050 INFO L85 PathProgramCache]: Analyzing trace with hash -742910394, now seen corresponding path program 1 times [2024-11-19 01:02:59,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:02:59,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057485885] [2024-11-19 01:02:59,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:59,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:02:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:02:59,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:02:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:02:59,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:02:59,347 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:02:59,348 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:02:59,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 01:02:59,353 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:59,541 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:02:59,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:02:59 BoogieIcfgContainer [2024-11-19 01:02:59,544 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:02:59,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:02:59,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:02:59,546 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:02:59,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:02:34" (3/4) ... [2024-11-19 01:02:59,549 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:02:59,550 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:02:59,551 INFO L158 Benchmark]: Toolchain (without parser) took 26741.82ms. Allocated memory was 148.9MB in the beginning and 572.5MB in the end (delta: 423.6MB). Free memory was 80.0MB in the beginning and 380.6MB in the end (delta: -300.7MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB. [2024-11-19 01:02:59,551 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:02:59,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.21ms. Allocated memory is still 148.9MB. Free memory was 79.7MB in the beginning and 64.0MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 01:02:59,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.23ms. Allocated memory is still 148.9MB. Free memory was 64.0MB in the beginning and 118.6MB in the end (delta: -54.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:02:59,552 INFO L158 Benchmark]: Boogie Preprocessor took 116.53ms. Allocated memory is still 148.9MB. Free memory was 118.6MB in the beginning and 113.7MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 01:02:59,552 INFO L158 Benchmark]: RCFGBuilder took 919.84ms. Allocated memory is still 148.9MB. Free memory was 113.0MB in the beginning and 69.7MB in the end (delta: 43.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-19 01:02:59,552 INFO L158 Benchmark]: TraceAbstraction took 25173.63ms. Allocated memory was 148.9MB in the beginning and 572.5MB in the end (delta: 423.6MB). Free memory was 69.0MB in the beginning and 380.6MB in the end (delta: -311.6MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. [2024-11-19 01:02:59,555 INFO L158 Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 572.5MB. Free memory is still 380.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:02:59,556 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.19ms. Allocated memory is still 117.4MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.21ms. Allocated memory is still 148.9MB. Free memory was 79.7MB in the beginning and 64.0MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.23ms. Allocated memory is still 148.9MB. Free memory was 64.0MB in the beginning and 118.6MB in the end (delta: -54.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.53ms. Allocated memory is still 148.9MB. Free memory was 118.6MB in the beginning and 113.7MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 919.84ms. Allocated memory is still 148.9MB. Free memory was 113.0MB in the beginning and 69.7MB in the end (delta: 43.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 25173.63ms. Allocated memory was 148.9MB in the beginning and 572.5MB in the end (delta: 423.6MB). Free memory was 69.0MB in the beginning and 380.6MB in the end (delta: -311.6MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. * Witness Printer took 4.80ms. Allocated memory is still 572.5MB. Free memory is still 380.6MB. 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 someBinaryFLOATComparisonOperation at line 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L22] signed short int var_1_1 = 16; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_7 = 32; [L24] signed short int var_1_7 = 32; [L25] signed short int* var_1_7_Pointer = &(var_1_7); [L26] signed short int var_1_8 = 20113; [L26] signed short int var_1_8 = 20113; [L27] signed short int* var_1_8_Pointer = &(var_1_8); [L28] signed short int var_1_9 = 100; [L28] signed short int var_1_9 = 100; [L29] signed short int* var_1_9_Pointer = &(var_1_9); [L30] signed char var_1_10 = 100; [L30] signed char var_1_10 = 100; [L31] signed char* var_1_10_Pointer = &(var_1_10); [L32] signed char var_1_11 = -1; [L32] signed char var_1_11 = -1; [L33] signed char* var_1_11_Pointer = &(var_1_11); [L34] signed char var_1_12 = 16; [L34] signed char var_1_12 = 16; [L35] signed char* var_1_12_Pointer = &(var_1_12); [L36] unsigned char var_1_13 = 1; [L36] unsigned char var_1_13 = 1; [L37] unsigned char* var_1_13_Pointer = &(var_1_13); [L38] unsigned char var_1_15 = 0; [L38] unsigned char var_1_15 = 0; [L39] unsigned char* var_1_15_Pointer = &(var_1_15); [L40] unsigned char var_1_16 = 1; [L40] unsigned char var_1_16 = 1; [L41] unsigned char* var_1_16_Pointer = &(var_1_16); [L42] unsigned short int var_1_18 = 10; [L42] unsigned short int var_1_18 = 10; [L43] unsigned short int* var_1_18_Pointer = &(var_1_18); [L44] unsigned short int var_1_19 = 256; [L44] unsigned short int var_1_19 = 256; [L45] unsigned short int* var_1_19_Pointer = &(var_1_19); [L46] float var_1_20 = 32.5; [L46] float var_1_20 = 32.5; [L47] float* var_1_20_Pointer = &(var_1_20); [L48] float var_1_21 = 127.4; [L48] float var_1_21 = 127.4; [L49] float* var_1_21_Pointer = &(var_1_21); [L50] signed short int var_1_22 = 128; [L50] signed short int var_1_22 = 128; [L51] signed short int* var_1_22_Pointer = &(var_1_22); VAL [isInitial=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] FCALL updateLastVariables() [L123] CALL updateVariables() [L85] var_1_7 = __VERIFIER_nondet_short() [L86] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L88] var_1_8 = __VERIFIER_nondet_short() [L89] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] var_1_9 = __VERIFIER_nondet_short() [L92] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L93] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L93] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L93] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L94] var_1_11 = __VERIFIER_nondet_char() [L95] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L95] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L95] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L96] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L96] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L96] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] var_1_12 = __VERIFIER_nondet_char() [L98] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L98] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L98] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L100] var_1_15 = __VERIFIER_nondet_uchar() [L101] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L101] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L101] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L102] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L102] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L102] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L103] var_1_16 = __VERIFIER_nondet_uchar() [L104] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L104] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L104] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L106] var_1_19 = __VERIFIER_nondet_ushort() [L107] EXPR \read(var_1_19) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L107] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L107] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] EXPR \read(var_1_19) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L109] var_1_21 = __VERIFIER_nondet_float() [L110] EXPR \read(var_1_21) [L110] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F [L110] EXPR \read(var_1_21) [L110] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] EXPR (var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] EXPR (var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L123] RET updateVariables() [L124] CALL step() [L55] EXPR \read(*var_1_19_Pointer) [L55] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L56] EXPR \read(*var_1_21_Pointer) [L56] (*(var_1_20_Pointer)) = (*(var_1_21_Pointer)) [L57] EXPR \read(*var_1_12_Pointer) [L57] (*(var_1_22_Pointer)) = (*(var_1_12_Pointer)) [L58] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L58] COND TRUE 127.5f > (*(var_1_20_Pointer)) [L59] EXPR \read(*var_1_15_Pointer) [L59] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L59] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) [L59] EXPR \read(*var_1_16_Pointer) [L59] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L59] (*(var_1_13_Pointer)) = ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))) [L63] EXPR \read(*var_1_18_Pointer) [L63] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L63] COND TRUE (*(var_1_18_Pointer)) == (*(var_1_7_Pointer)) [L64] EXPR \read(*var_1_11_Pointer) [L64] EXPR \read(*var_1_12_Pointer) [L64] (*(var_1_10_Pointer)) = ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)) [L72] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L72] COND TRUE (*(var_1_13_Pointer)) [L73] EXPR \read(*var_1_10_Pointer) [L73] EXPR \read(*var_1_22_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] COND FALSE !((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) [L80] (*(var_1_1_Pointer)) = 8 VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1 [L115] EXPR \read(*var_1_10_Pointer) [L115] EXPR \read(*var_1_22_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8)) [L115] EXPR \read(*var_1_1_Pointer) [L115] EXPR ((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1 VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1)) [L115] EXPR \read(*var_1_18_Pointer) [L115] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1) [L115] EXPR \read(*var_1_10_Pointer) [L115] EXPR \read(*var_1_11_Pointer) [L115] EXPR \read(*var_1_12_Pointer) [L115] EXPR ((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)))))) [L115] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))) [L115] EXPR \read(*var_1_13_Pointer) [L115] EXPR \read(*var_1_20_Pointer) [L115] EXPR \read(*var_1_20_Pointer) [L115] EXPR ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) [L115] EXPR \read(*var_1_18_Pointer) [L115] EXPR \read(*var_1_19_Pointer) [L115] EXPR ((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) [L115] EXPR \read(*var_1_20_Pointer) [L115] EXPR \read(*var_1_21_Pointer) [L115] EXPR (((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((signed short int) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((signed short int) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115-L116] return ((((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((signed short int) (*(var_1_12_Pointer)))) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 21, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3734 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3734 mSDsluCounter, 15772 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12270 mSDsCounter, 610 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3388 IncrementalHoareTripleChecker+Invalid, 3998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 610 mSolverCounterUnsat, 3502 mSDtfsCounter, 3388 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2278 GetRequests, 2023 SyntacticMatches, 7 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=11, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 1358 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 4388 NumberOfCodeBlocks, 4388 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 4761 ConstructedInterpolants, 0 QuantifiedInterpolants, 14075 SizeOfPredicates, 54 NumberOfNonLiveVariables, 6779 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 35 InterpolantComputations, 17 PerfectInterpolantSequences, 17698/19040 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-19 01:02:59,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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-p_file-97.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 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:03:01,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:03:01,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:03:01,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:03:01,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:03:01,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:03:01,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:03:01,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:03:01,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:03:01,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:03:01,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:03:01,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:03:01,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:03:01,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:03:01,919 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:03:01,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:03:01,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:03:01,923 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:03:01,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:03:01,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:03:01,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:03:01,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:03:01,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:03:01,927 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:03:01,927 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:03:01,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:03:01,928 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:03:01,928 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:03:01,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:03:01,928 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:03:01,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:03:01,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:03:01,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:03:01,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:03:01,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:03:01,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:03:01,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:03:01,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:03:01,930 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:03:01,932 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:03:01,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:03:01,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:03:01,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:03:01,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:03:01,934 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 -> 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b [2024-11-19 01:03:02,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:03:02,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:03:02,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:03:02,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:03:02,282 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:03:02,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-11-19 01:03:03,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:03:04,217 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:03:04,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-11-19 01:03:04,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dec8aa899/62413c2f0a324ffcb580b83c83af3b8a/FLAGf0b025ce3 [2024-11-19 01:03:04,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dec8aa899/62413c2f0a324ffcb580b83c83af3b8a [2024-11-19 01:03:04,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:03:04,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:03:04,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:03:04,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:03:04,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:03:04,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:03:04" (1/1) ... [2024-11-19 01:03:04,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5377e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:04, skipping insertion in model container [2024-11-19 01:03:04,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:03:04" (1/1) ... [2024-11-19 01:03:04,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:03:04,821 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-p_file-97.i[916,929] [2024-11-19 01:03:04,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:03:04,927 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:03:04,943 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-p_file-97.i[916,929] [2024-11-19 01:03:04,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:03:05,010 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:03:05,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05 WrapperNode [2024-11-19 01:03:05,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:03:05,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:03:05,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:03:05,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:03:05,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05" (1/1) ... [2024-11-19 01:03:05,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05" (1/1) ... [2024-11-19 01:03:05,084 INFO L138 Inliner]: procedures = 33, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2024-11-19 01:03:05,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:03:05,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:03:05,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:03:05,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:03:05,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05" (1/1) ... [2024-11-19 01:03:05,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05" (1/1) ... [2024-11-19 01:03:05,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05" (1/1) ... [2024-11-19 01:03:05,146 INFO L175 MemorySlicer]: Split 116 memory accesses to 16 slices as follows [2, 7, 8, 6, 6, 7, 8, 10, 11, 8, 6, 7, 6, 9, 8, 7]. 9 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-11-19 01:03:05,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05" (1/1) ... [2024-11-19 01:03:05,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05" (1/1) ... [2024-11-19 01:03:05,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05" (1/1) ... [2024-11-19 01:03:05,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05" (1/1) ... [2024-11-19 01:03:05,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05" (1/1) ... [2024-11-19 01:03:05,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05" (1/1) ... [2024-11-19 01:03:05,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:03:05,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:03:05,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:03:05,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:03:05,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05" (1/1) ... [2024-11-19 01:03:05,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:03:05,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:03:05,262 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-19 01:03:05,266 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-19 01:03:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:03:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 01:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 01:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 01:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 01:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 01:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-19 01:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-19 01:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-19 01:03:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-19 01:03:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-19 01:03:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-19 01:03:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-19 01:03:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-19 01:03:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-11-19 01:03:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 01:03:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 01:03:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 01:03:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 01:03:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 01:03:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 01:03:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-19 01:03:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-19 01:03:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-19 01:03:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-19 01:03:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-19 01:03:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-19 01:03:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-19 01:03:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-19 01:03:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-19 01:03:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-11-19 01:03:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:03:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:03:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 01:03:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 01:03:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 01:03:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 01:03:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 01:03:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-19 01:03:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-19 01:03:05,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-19 01:03:05,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-19 01:03:05,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-19 01:03:05,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-19 01:03:05,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-19 01:03:05,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-19 01:03:05,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-11-19 01:03:05,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 01:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 01:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 01:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 01:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-19 01:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-19 01:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-19 01:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-19 01:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-19 01:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-19 01:03:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-19 01:03:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-11-19 01:03:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-11-19 01:03:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-11-19 01:03:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:03:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:03:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 01:03:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 01:03:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 01:03:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-19 01:03:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-19 01:03:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-19 01:03:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-19 01:03:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-19 01:03:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-19 01:03:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-19 01:03:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-19 01:03:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-19 01:03:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-11-19 01:03:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-11-19 01:03:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:03:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:03:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 01:03:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 01:03:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 01:03:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 01:03:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-19 01:03:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-19 01:03:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-19 01:03:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-19 01:03:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-19 01:03:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-19 01:03:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-19 01:03:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-11-19 01:03:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-11-19 01:03:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-11-19 01:03:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 01:03:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 01:03:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 01:03:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 01:03:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 01:03:05,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 01:03:05,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-19 01:03:05,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-19 01:03:05,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-19 01:03:05,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-19 01:03:05,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-19 01:03:05,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-19 01:03:05,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-19 01:03:05,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-11-19 01:03:05,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-11-19 01:03:05,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-11-19 01:03:05,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:03:05,334 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:03:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:03:05,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:03:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:03:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:03:05,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 01:03:05,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 01:03:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 01:03:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 01:03:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 01:03:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-19 01:03:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-19 01:03:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-19 01:03:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-19 01:03:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-19 01:03:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-19 01:03:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-19 01:03:05,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-19 01:03:05,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-11-19 01:03:05,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:03:05,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:03:05,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 01:03:05,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 01:03:05,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 01:03:05,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-19 01:03:05,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-19 01:03:05,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-19 01:03:05,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-19 01:03:05,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-19 01:03:05,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-19 01:03:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-19 01:03:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-19 01:03:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-19 01:03:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-11-19 01:03:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-11-19 01:03:05,589 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:03:05,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:03:06,155 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2024-11-19 01:03:06,155 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:03:06,179 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:03:06,180 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:03:06,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:03:06 BoogieIcfgContainer [2024-11-19 01:03:06,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:03:06,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:03:06,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:03:06,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:03:06,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:03:04" (1/3) ... [2024-11-19 01:03:06,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0afce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:03:06, skipping insertion in model container [2024-11-19 01:03:06,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:05" (2/3) ... [2024-11-19 01:03:06,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0afce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:03:06, skipping insertion in model container [2024-11-19 01:03:06,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:03:06" (3/3) ... [2024-11-19 01:03:06,189 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-97.i [2024-11-19 01:03:06,205 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:03:06,205 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:03:06,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:03:06,288 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;@3b6e3768, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:03:06,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:03:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:03:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:03:06,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:06,306 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:06,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:06,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash 993834081, now seen corresponding path program 1 times [2024-11-19 01:03:06,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:06,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896890564] [2024-11-19 01:03:06,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:06,324 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-19 01:03:06,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:06,327 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-19 01:03:06,352 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-19 01:03:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:06,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:03:06,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-19 01:03:06,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:03:06,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:06,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896890564] [2024-11-19 01:03:06,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896890564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:03:06,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:03:06,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:03:06,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143485388] [2024-11-19 01:03:06,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:06,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:03:06,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:06,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:03:06,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:03:06,833 INFO L87 Difference]: Start difference. First operand has 100 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:03:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:06,867 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2024-11-19 01:03:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:03:06,871 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-11-19 01:03:06,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:06,878 INFO L225 Difference]: With dead ends: 193 [2024-11-19 01:03:06,878 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 01:03:06,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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-19 01:03:06,884 INFO L432 NwaCegarLoop]: 138 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, 138 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-19 01:03:06,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:03:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 01:03:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 01:03:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:03:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-19 01:03:06,928 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 134 [2024-11-19 01:03:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:06,929 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-19 01:03:06,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:03:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-19 01:03:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:03:06,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:06,933 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:06,940 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-19 01:03:07,137 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-19 01:03:07,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:07,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:07,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1139851071, now seen corresponding path program 1 times [2024-11-19 01:03:07,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:07,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650941654] [2024-11-19 01:03:07,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:07,140 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-19 01:03:07,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:07,143 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-19 01:03:07,144 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-19 01:03:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:07,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 01:03:07,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:08,429 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 42 treesize of output 26 [2024-11-19 01:03:08,473 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-19 01:03:08,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 01:03:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-19 01:03:08,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:03:09,004 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-19 01:03:09,005 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 30 treesize of output 25 [2024-11-19 01:03:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-19 01:03:09,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:09,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650941654] [2024-11-19 01:03:09,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650941654] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:03:09,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:03:09,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-11-19 01:03:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392904546] [2024-11-19 01:03:09,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:03:09,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 01:03:09,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:09,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 01:03:09,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:03:09,197 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:10,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:10,805 INFO L93 Difference]: Finished difference Result 304 states and 426 transitions. [2024-11-19 01:03:10,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 01:03:10,805 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 134 [2024-11-19 01:03:10,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:10,811 INFO L225 Difference]: With dead ends: 304 [2024-11-19 01:03:10,811 INFO L226 Difference]: Without dead ends: 211 [2024-11-19 01:03:10,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 01:03:10,813 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 653 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:10,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1454 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:03:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-19 01:03:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 111. [2024-11-19 01:03:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:03:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 154 transitions. [2024-11-19 01:03:10,852 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 154 transitions. Word has length 134 [2024-11-19 01:03:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:10,856 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 154 transitions. [2024-11-19 01:03:10,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 154 transitions. [2024-11-19 01:03:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:03:10,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:10,860 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:10,870 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 (3)] Forceful destruction successful, exit code 0 [2024-11-19 01:03:11,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-19 01:03:11,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:11,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1358705789, now seen corresponding path program 1 times [2024-11-19 01:03:11,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:11,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327546799] [2024-11-19 01:03:11,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:11,068 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-19 01:03:11,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:11,072 INFO L229 MonitoredProcess]: Starting monitored process 4 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-19 01:03:11,073 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 (4)] Waiting until timeout for monitored process [2024-11-19 01:03:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:11,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 01:03:11,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:12,058 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 42 treesize of output 26 [2024-11-19 01:03:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-11-19 01:03:12,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:03:12,374 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-19 01:03:12,374 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 30 treesize of output 25 [2024-11-19 01:03:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-19 01:03:12,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:12,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327546799] [2024-11-19 01:03:12,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327546799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:03:12,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:03:12,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-11-19 01:03:12,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941306966] [2024-11-19 01:03:12,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:03:12,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 01:03:12,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:12,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 01:03:12,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:03:12,531 INFO L87 Difference]: Start difference. First operand 111 states and 154 transitions. Second operand has 20 states, 16 states have (on average 5.1875) internal successors, (83), 18 states have internal predecessors, (83), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:13,343 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2024-11-19 01:03:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 01:03:13,344 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 5.1875) internal successors, (83), 18 states have internal predecessors, (83), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 134 [2024-11-19 01:03:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:13,345 INFO L225 Difference]: With dead ends: 250 [2024-11-19 01:03:13,345 INFO L226 Difference]: Without dead ends: 142 [2024-11-19 01:03:13,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2024-11-19 01:03:13,347 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 696 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:13,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 904 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:03:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-19 01:03:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-19 01:03:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 107 states have internal predecessors, (135), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 01:03:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 189 transitions. [2024-11-19 01:03:13,369 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 189 transitions. Word has length 134 [2024-11-19 01:03:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:13,370 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 189 transitions. [2024-11-19 01:03:13,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 5.1875) internal successors, (83), 18 states have internal predecessors, (83), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 189 transitions. [2024-11-19 01:03:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:03:13,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:13,373 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:13,383 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 (4)] Forceful destruction successful, exit code 0 [2024-11-19 01:03:13,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-19 01:03:13,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:13,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:13,578 INFO L85 PathProgramCache]: Analyzing trace with hash 416205030, now seen corresponding path program 1 times [2024-11-19 01:03:13,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:13,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206983539] [2024-11-19 01:03:13,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:13,579 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-19 01:03:13,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:13,582 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-19 01:03:13,583 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-19 01:03:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:13,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 01:03:13,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:14,443 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 42 treesize of output 26 [2024-11-19 01:03:14,463 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-19 01:03:14,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 01:03:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-11-19 01:03:14,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:03:14,918 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-19 01:03:14,918 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 30 treesize of output 25 [2024-11-19 01:03:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-19 01:03:15,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:15,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206983539] [2024-11-19 01:03:15,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206983539] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:03:15,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:03:15,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-11-19 01:03:15,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127753225] [2024-11-19 01:03:15,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:03:15,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 01:03:15,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:15,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 01:03:15,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:03:15,051 INFO L87 Difference]: Start difference. First operand 139 states and 189 transitions. Second operand has 24 states, 20 states have (on average 4.45) internal successors, (89), 22 states have internal predecessors, (89), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:16,622 INFO L93 Difference]: Finished difference Result 362 states and 485 transitions. [2024-11-19 01:03:16,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 01:03:16,623 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.45) internal successors, (89), 22 states have internal predecessors, (89), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 134 [2024-11-19 01:03:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:16,625 INFO L225 Difference]: With dead ends: 362 [2024-11-19 01:03:16,625 INFO L226 Difference]: Without dead ends: 247 [2024-11-19 01:03:16,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 01:03:16,630 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 419 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:16,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1922 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:03:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-19 01:03:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2024-11-19 01:03:16,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 178 states have (on average 1.2696629213483146) internal successors, (226), 180 states have internal predecessors, (226), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 01:03:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 314 transitions. [2024-11-19 01:03:16,679 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 314 transitions. Word has length 134 [2024-11-19 01:03:16,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:16,680 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 314 transitions. [2024-11-19 01:03:16,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.45) internal successors, (89), 22 states have internal predecessors, (89), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 314 transitions. [2024-11-19 01:03:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 01:03:16,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:16,685 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:16,699 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-19 01:03:16,885 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-19 01:03:16,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:16,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:16,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2003702363, now seen corresponding path program 1 times [2024-11-19 01:03:16,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:16,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754025059] [2024-11-19 01:03:16,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:16,887 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-19 01:03:16,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:16,890 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-19 01:03:16,891 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-19 01:03:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:17,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 01:03:17,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:17,620 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 42 treesize of output 26 [2024-11-19 01:03:17,636 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-19 01:03:17,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 01:03:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-19 01:03:17,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:03:18,029 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-19 01:03:18,030 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 30 treesize of output 25 [2024-11-19 01:03:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-19 01:03:18,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:18,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754025059] [2024-11-19 01:03:18,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754025059] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:03:18,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:03:18,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-11-19 01:03:18,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453487443] [2024-11-19 01:03:18,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:03:18,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 01:03:18,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:18,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 01:03:18,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:03:18,174 INFO L87 Difference]: Start difference. First operand 233 states and 314 transitions. Second operand has 24 states, 20 states have (on average 4.55) internal successors, (91), 22 states have internal predecessors, (91), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:19,232 INFO L93 Difference]: Finished difference Result 496 states and 654 transitions. [2024-11-19 01:03:19,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 01:03:19,233 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.55) internal successors, (91), 22 states have internal predecessors, (91), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 135 [2024-11-19 01:03:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:19,236 INFO L225 Difference]: With dead ends: 496 [2024-11-19 01:03:19,236 INFO L226 Difference]: Without dead ends: 287 [2024-11-19 01:03:19,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 01:03:19,239 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 652 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:19,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1354 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:03:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-19 01:03:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 182. [2024-11-19 01:03:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 137 states have (on average 1.2408759124087592) internal successors, (170), 138 states have internal predecessors, (170), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:03:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 238 transitions. [2024-11-19 01:03:19,268 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 238 transitions. Word has length 135 [2024-11-19 01:03:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:19,268 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 238 transitions. [2024-11-19 01:03:19,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.55) internal successors, (91), 22 states have internal predecessors, (91), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2024-11-19 01:03:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 01:03:19,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:19,270 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:19,279 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 (6)] Forceful destruction successful, exit code 0 [2024-11-19 01:03:19,471 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-19 01:03:19,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:19,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:19,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1045511572, now seen corresponding path program 1 times [2024-11-19 01:03:19,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:19,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725205797] [2024-11-19 01:03:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:19,473 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-19 01:03:19,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:19,474 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-19 01:03:19,475 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-19 01:03:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:19,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 01:03:19,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:20,141 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 42 treesize of output 26 [2024-11-19 01:03:20,154 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-19 01:03:20,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 01:03:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-11-19 01:03:20,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:03:20,488 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-19 01:03:20,489 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 30 treesize of output 25 [2024-11-19 01:03:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-19 01:03:20,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:20,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725205797] [2024-11-19 01:03:20,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725205797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:03:20,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:03:20,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-11-19 01:03:20,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701268793] [2024-11-19 01:03:20,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:03:20,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 01:03:20,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:20,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 01:03:20,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:03:20,586 INFO L87 Difference]: Start difference. First operand 182 states and 238 transitions. Second operand has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:21,930 INFO L93 Difference]: Finished difference Result 406 states and 533 transitions. [2024-11-19 01:03:21,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 01:03:21,932 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 135 [2024-11-19 01:03:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:21,934 INFO L225 Difference]: With dead ends: 406 [2024-11-19 01:03:21,934 INFO L226 Difference]: Without dead ends: 287 [2024-11-19 01:03:21,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 01:03:21,937 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 502 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:21,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1781 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:03:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-19 01:03:21,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 172. [2024-11-19 01:03:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 127 states have (on average 1.2125984251968505) internal successors, (154), 128 states have internal predecessors, (154), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:03:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 222 transitions. [2024-11-19 01:03:21,973 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 222 transitions. Word has length 135 [2024-11-19 01:03:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:21,974 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 222 transitions. [2024-11-19 01:03:21,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2024-11-19 01:03:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 01:03:21,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:21,976 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:21,985 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-19 01:03:22,176 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-19 01:03:22,177 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:22,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:22,177 INFO L85 PathProgramCache]: Analyzing trace with hash -598123699, now seen corresponding path program 1 times [2024-11-19 01:03:22,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:22,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606003917] [2024-11-19 01:03:22,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:22,178 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-19 01:03:22,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:22,179 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-19 01:03:22,180 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-19 01:03:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:22,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 01:03:22,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:22,424 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-19 01:03:22,445 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-19 01:03:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:03:22,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:03:22,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:22,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606003917] [2024-11-19 01:03:22,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606003917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:03:22,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:03:22,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:03:22,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333717022] [2024-11-19 01:03:22,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:22,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:03:22,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:22,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:03:22,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:03:22,486 INFO L87 Difference]: Start difference. First operand 172 states and 222 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:22,614 INFO L93 Difference]: Finished difference Result 393 states and 514 transitions. [2024-11-19 01:03:22,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:03:22,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-11-19 01:03:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:22,617 INFO L225 Difference]: With dead ends: 393 [2024-11-19 01:03:22,617 INFO L226 Difference]: Without dead ends: 284 [2024-11-19 01:03:22,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 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-19 01:03:22,621 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 130 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:22,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1063 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:03:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-19 01:03:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 178. [2024-11-19 01:03:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 134 states have internal predecessors, (161), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:03:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 229 transitions. [2024-11-19 01:03:22,646 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 229 transitions. Word has length 137 [2024-11-19 01:03:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:22,647 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 229 transitions. [2024-11-19 01:03:22,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:22,648 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 229 transitions. [2024-11-19 01:03:22,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 01:03:22,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:22,650 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:22,658 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 (8)] Ended with exit code 0 [2024-11-19 01:03:22,850 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-19 01:03:22,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:22,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:22,851 INFO L85 PathProgramCache]: Analyzing trace with hash -967851096, now seen corresponding path program 1 times [2024-11-19 01:03:22,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:22,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010741936] [2024-11-19 01:03:22,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:22,852 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-19 01:03:22,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:22,853 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-19 01:03:22,854 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-19 01:03:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:23,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 01:03:23,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:23,512 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 42 treesize of output 26 [2024-11-19 01:03:23,528 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-19 01:03:23,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 01:03:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-19 01:03:23,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:03:23,862 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-19 01:03:23,862 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 30 treesize of output 25 [2024-11-19 01:03:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-19 01:03:23,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:23,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010741936] [2024-11-19 01:03:23,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010741936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:03:23,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:03:23,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-11-19 01:03:23,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168430675] [2024-11-19 01:03:23,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:03:23,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 01:03:23,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:23,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 01:03:23,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:03:23,978 INFO L87 Difference]: Start difference. First operand 178 states and 229 transitions. Second operand has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:24,962 INFO L93 Difference]: Finished difference Result 414 states and 537 transitions. [2024-11-19 01:03:24,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 01:03:24,962 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 138 [2024-11-19 01:03:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:24,964 INFO L225 Difference]: With dead ends: 414 [2024-11-19 01:03:24,964 INFO L226 Difference]: Without dead ends: 299 [2024-11-19 01:03:24,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 01:03:24,966 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 904 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:24,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 903 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:03:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-19 01:03:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 186. [2024-11-19 01:03:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 142 states have internal predecessors, (173), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:03:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 241 transitions. [2024-11-19 01:03:24,989 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 241 transitions. Word has length 138 [2024-11-19 01:03:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:24,990 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 241 transitions. [2024-11-19 01:03:24,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2024-11-19 01:03:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 01:03:24,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:24,992 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:25,001 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 (9)] Forceful destruction successful, exit code 0 [2024-11-19 01:03:25,192 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-19 01:03:25,193 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:25,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash 721092646, now seen corresponding path program 1 times [2024-11-19 01:03:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:25,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768797932] [2024-11-19 01:03:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:25,194 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-19 01:03:25,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:25,197 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-19 01:03:25,198 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-19 01:03:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:25,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:03:25,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:03:25,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:03:25,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:25,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768797932] [2024-11-19 01:03:25,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768797932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:03:25,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:03:25,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:03:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63952670] [2024-11-19 01:03:25,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:25,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:03:25,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:03:25,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:03:25,454 INFO L87 Difference]: Start difference. First operand 186 states and 241 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:25,495 INFO L93 Difference]: Finished difference Result 314 states and 411 transitions. [2024-11-19 01:03:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:03:25,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-11-19 01:03:25,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:25,497 INFO L225 Difference]: With dead ends: 314 [2024-11-19 01:03:25,497 INFO L226 Difference]: Without dead ends: 191 [2024-11-19 01:03:25,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 134 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-19 01:03:25,499 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:25,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 504 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:03:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-19 01:03:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2024-11-19 01:03:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 145 states have (on average 1.2206896551724138) internal successors, (177), 146 states have internal predecessors, (177), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:03:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 245 transitions. [2024-11-19 01:03:25,530 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 245 transitions. Word has length 138 [2024-11-19 01:03:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:25,531 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 245 transitions. [2024-11-19 01:03:25,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 245 transitions. [2024-11-19 01:03:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 01:03:25,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:25,532 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:25,541 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 (10)] Forceful destruction successful, exit code 0 [2024-11-19 01:03:25,733 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-19 01:03:25,733 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:25,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:25,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1401151016, now seen corresponding path program 1 times [2024-11-19 01:03:25,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:25,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311685203] [2024-11-19 01:03:25,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:25,734 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-19 01:03:25,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:25,737 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-19 01:03:25,738 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-19 01:03:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:26,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:03:26,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:03:26,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:03:26,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:26,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311685203] [2024-11-19 01:03:26,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311685203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:03:26,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:03:26,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:03:26,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931121999] [2024-11-19 01:03:26,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:26,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:03:26,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:26,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:03:26,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:03:26,053 INFO L87 Difference]: Start difference. First operand 190 states and 245 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:26,097 INFO L93 Difference]: Finished difference Result 320 states and 416 transitions. [2024-11-19 01:03:26,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:03:26,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-11-19 01:03:26,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:26,099 INFO L225 Difference]: With dead ends: 320 [2024-11-19 01:03:26,099 INFO L226 Difference]: Without dead ends: 193 [2024-11-19 01:03:26,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:03:26,100 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:26,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 620 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:03:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-19 01:03:26,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2024-11-19 01:03:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 147 states have (on average 1.217687074829932) internal successors, (179), 148 states have internal predecessors, (179), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:03:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 247 transitions. [2024-11-19 01:03:26,125 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 247 transitions. Word has length 138 [2024-11-19 01:03:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:26,125 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 247 transitions. [2024-11-19 01:03:26,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 247 transitions. [2024-11-19 01:03:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 01:03:26,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:26,127 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:26,137 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 (11)] Ended with exit code 0 [2024-11-19 01:03:26,328 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-19 01:03:26,328 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:26,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:26,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1118808918, now seen corresponding path program 1 times [2024-11-19 01:03:26,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:26,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582183941] [2024-11-19 01:03:26,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:26,329 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-19 01:03:26,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:26,330 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-19 01:03:26,331 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-19 01:03:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:26,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 01:03:26,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:03:26,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:03:26,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:26,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582183941] [2024-11-19 01:03:26,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582183941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:03:26,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:03:26,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:03:26,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639526128] [2024-11-19 01:03:26,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:26,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:03:26,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:26,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:03:26,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:03:26,611 INFO L87 Difference]: Start difference. First operand 192 states and 247 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:26,667 INFO L93 Difference]: Finished difference Result 324 states and 420 transitions. [2024-11-19 01:03:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:03:26,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-11-19 01:03:26,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:26,670 INFO L225 Difference]: With dead ends: 324 [2024-11-19 01:03:26,670 INFO L226 Difference]: Without dead ends: 195 [2024-11-19 01:03:26,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:03:26,671 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:26,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 737 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:03:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-19 01:03:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2024-11-19 01:03:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 149 states have (on average 1.2147651006711409) internal successors, (181), 150 states have internal predecessors, (181), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:03:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 249 transitions. [2024-11-19 01:03:26,691 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 249 transitions. Word has length 138 [2024-11-19 01:03:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:26,692 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 249 transitions. [2024-11-19 01:03:26,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 249 transitions. [2024-11-19 01:03:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 01:03:26,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:26,694 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:26,703 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-19 01:03:26,897 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-19 01:03:26,898 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:26,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:26,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1116961876, now seen corresponding path program 1 times [2024-11-19 01:03:26,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:26,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859190312] [2024-11-19 01:03:26,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:26,899 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-19 01:03:26,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:26,902 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-19 01:03:26,903 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-19 01:03:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:27,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 01:03:27,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:27,563 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-19 01:03:27,566 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 14 treesize of output 10 [2024-11-19 01:03:27,804 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 24 treesize of output 16 [2024-11-19 01:03:27,808 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 30 treesize of output 18 [2024-11-19 01:03:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 31 proven. 309 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-19 01:03:28,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:03:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:03:29,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859190312] [2024-11-19 01:03:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859190312] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:03:29,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:03:29,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-19 01:03:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527045913] [2024-11-19 01:03:29,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:29,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:03:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:29,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:03:29,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-19 01:03:29,306 INFO L87 Difference]: Start difference. First operand 194 states and 249 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:29,502 INFO L93 Difference]: Finished difference Result 426 states and 548 transitions. [2024-11-19 01:03:29,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:03:29,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-11-19 01:03:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:29,504 INFO L225 Difference]: With dead ends: 426 [2024-11-19 01:03:29,504 INFO L226 Difference]: Without dead ends: 295 [2024-11-19 01:03:29,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:03:29,505 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 110 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:29,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 704 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:03:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-19 01:03:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 194. [2024-11-19 01:03:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 149 states have (on average 1.2080536912751678) internal successors, (180), 150 states have internal predecessors, (180), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:03:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 248 transitions. [2024-11-19 01:03:29,537 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 248 transitions. Word has length 138 [2024-11-19 01:03:29,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:29,537 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 248 transitions. [2024-11-19 01:03:29,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 248 transitions. [2024-11-19 01:03:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 01:03:29,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:29,540 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:29,549 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 (13)] Forceful destruction successful, exit code 0 [2024-11-19 01:03:29,741 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-19 01:03:29,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:29,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2101173006, now seen corresponding path program 1 times [2024-11-19 01:03:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:29,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542824823] [2024-11-19 01:03:29,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:29,742 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-19 01:03:29,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:29,743 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-19 01:03:29,745 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-19 01:03:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:30,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 01:03:30,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:30,205 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 28 treesize of output 24 [2024-11-19 01:03:30,258 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 87 treesize of output 75 [2024-11-19 01:03:30,260 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 75 treesize of output 63 [2024-11-19 01:03:30,262 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 63 treesize of output 51 [2024-11-19 01:03:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-19 01:03:30,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:03:30,367 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 39 treesize of output 31 [2024-11-19 01:03:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:03:30,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:30,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542824823] [2024-11-19 01:03:30,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542824823] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:03:30,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:03:30,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2024-11-19 01:03:30,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322846790] [2024-11-19 01:03:30,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:30,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:03:30,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:30,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:03:30,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:03:30,451 INFO L87 Difference]: Start difference. First operand 194 states and 248 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:30,595 INFO L93 Difference]: Finished difference Result 402 states and 517 transitions. [2024-11-19 01:03:30,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:03:30,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-19 01:03:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:30,597 INFO L225 Difference]: With dead ends: 402 [2024-11-19 01:03:30,597 INFO L226 Difference]: Without dead ends: 271 [2024-11-19 01:03:30,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:03:30,598 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 69 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:30,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 696 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:03:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-19 01:03:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2024-11-19 01:03:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 216 states have (on average 1.2222222222222223) internal successors, (264), 218 states have internal predecessors, (264), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:03:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 344 transitions. [2024-11-19 01:03:30,629 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 344 transitions. Word has length 139 [2024-11-19 01:03:30,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:30,629 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 344 transitions. [2024-11-19 01:03:30,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 344 transitions. [2024-11-19 01:03:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 01:03:30,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:30,631 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:30,641 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-19 01:03:30,832 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-19 01:03:30,832 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:30,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:30,833 INFO L85 PathProgramCache]: Analyzing trace with hash 521270392, now seen corresponding path program 1 times [2024-11-19 01:03:30,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:30,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298637518] [2024-11-19 01:03:30,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:30,833 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-19 01:03:30,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:30,834 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-19 01:03:30,836 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-19 01:03:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:31,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 01:03:31,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:31,590 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-19 01:03:31,592 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 14 treesize of output 10 [2024-11-19 01:03:31,780 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 25 treesize of output 17 [2024-11-19 01:03:31,785 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 31 treesize of output 19 [2024-11-19 01:03:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 31 proven. 309 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-19 01:03:32,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:03:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:03:33,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:33,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298637518] [2024-11-19 01:03:33,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298637518] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:03:33,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:03:33,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-19 01:03:33,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668888776] [2024-11-19 01:03:33,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:33,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:03:33,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:33,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:03:33,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-19 01:03:33,258 INFO L87 Difference]: Start difference. First operand 268 states and 344 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:33,526 INFO L93 Difference]: Finished difference Result 617 states and 795 transitions. [2024-11-19 01:03:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:03:33,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-19 01:03:33,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:33,531 INFO L225 Difference]: With dead ends: 617 [2024-11-19 01:03:33,531 INFO L226 Difference]: Without dead ends: 412 [2024-11-19 01:03:33,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:03:33,533 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 180 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:33,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 390 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:03:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-19 01:03:33,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 268. [2024-11-19 01:03:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 216 states have (on average 1.212962962962963) internal successors, (262), 218 states have internal predecessors, (262), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:03:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 342 transitions. [2024-11-19 01:03:33,568 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 342 transitions. Word has length 139 [2024-11-19 01:03:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:33,568 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 342 transitions. [2024-11-19 01:03:33,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:33,569 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 342 transitions. [2024-11-19 01:03:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 01:03:33,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:33,570 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:33,580 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 (15)] Forceful destruction successful, exit code 0 [2024-11-19 01:03:33,771 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-19 01:03:33,771 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:33,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1272825617, now seen corresponding path program 1 times [2024-11-19 01:03:33,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:33,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152629013] [2024-11-19 01:03:33,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:33,772 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-19 01:03:33,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:33,773 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-19 01:03:33,774 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-19 01:03:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:34,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 01:03:34,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:35,801 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 37 treesize of output 33 [2024-11-19 01:03:35,945 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 132 treesize of output 112 [2024-11-19 01:03:35,953 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 111 treesize of output 95 [2024-11-19 01:03:35,957 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 109 treesize of output 89 [2024-11-19 01:03:35,962 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 78 treesize of output 66 [2024-11-19 01:03:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 19 proven. 304 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-19 01:03:36,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:03:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:03:36,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:36,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152629013] [2024-11-19 01:03:36,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152629013] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:03:36,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:03:36,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [28] total 33 [2024-11-19 01:03:36,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627831528] [2024-11-19 01:03:36,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:36,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:03:36,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:36,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:03:36,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 01:03:36,316 INFO L87 Difference]: Start difference. First operand 268 states and 342 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:36,566 INFO L93 Difference]: Finished difference Result 570 states and 730 transitions. [2024-11-19 01:03:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:03:36,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-19 01:03:36,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:36,568 INFO L225 Difference]: With dead ends: 570 [2024-11-19 01:03:36,568 INFO L226 Difference]: Without dead ends: 365 [2024-11-19 01:03:36,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=1217, Unknown=0, NotChecked=0, Total=1332 [2024-11-19 01:03:36,570 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 48 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:36,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 883 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:03:36,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-19 01:03:36,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 278. [2024-11-19 01:03:36,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 226 states have (on average 1.2123893805309736) internal successors, (274), 228 states have internal predecessors, (274), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:03:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 354 transitions. [2024-11-19 01:03:36,597 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 354 transitions. Word has length 140 [2024-11-19 01:03:36,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:36,598 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 354 transitions. [2024-11-19 01:03:36,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:36,598 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 354 transitions. [2024-11-19 01:03:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 01:03:36,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:36,599 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:36,609 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-19 01:03:36,803 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-19 01:03:36,804 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:36,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash -315522285, now seen corresponding path program 1 times [2024-11-19 01:03:36,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:36,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416227828] [2024-11-19 01:03:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:36,805 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-19 01:03:36,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:36,808 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-19 01:03:36,809 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-19 01:03:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:37,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 01:03:37,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:37,489 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 42 treesize of output 26 [2024-11-19 01:03:37,504 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-19 01:03:37,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 01:03:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-19 01:03:37,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:03:37,805 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-19 01:03:37,806 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 30 treesize of output 25 [2024-11-19 01:03:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-19 01:03:37,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:37,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416227828] [2024-11-19 01:03:37,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416227828] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:03:37,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:03:37,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-11-19 01:03:37,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478806724] [2024-11-19 01:03:37,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:03:37,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 01:03:37,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:37,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 01:03:37,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:03:37,916 INFO L87 Difference]: Start difference. First operand 278 states and 354 transitions. Second operand has 24 states, 20 states have (on average 4.95) internal successors, (99), 22 states have internal predecessors, (99), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:38,955 INFO L93 Difference]: Finished difference Result 670 states and 852 transitions. [2024-11-19 01:03:38,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 01:03:38,955 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.95) internal successors, (99), 22 states have internal predecessors, (99), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 140 [2024-11-19 01:03:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:38,958 INFO L225 Difference]: With dead ends: 670 [2024-11-19 01:03:38,958 INFO L226 Difference]: Without dead ends: 455 [2024-11-19 01:03:38,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 01:03:38,960 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 1377 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:38,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 902 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:03:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-19 01:03:38,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 286. [2024-11-19 01:03:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 234 states have (on average 1.205128205128205) internal successors, (282), 236 states have internal predecessors, (282), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:03:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 362 transitions. [2024-11-19 01:03:38,990 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 362 transitions. Word has length 140 [2024-11-19 01:03:38,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:38,990 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 362 transitions. [2024-11-19 01:03:38,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.95) internal successors, (99), 22 states have internal predecessors, (99), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-19 01:03:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 362 transitions. [2024-11-19 01:03:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 01:03:38,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:38,992 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:39,002 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 (17)] Ended with exit code 0 [2024-11-19 01:03:39,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-19 01:03:39,192 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:39,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:39,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2026014256, now seen corresponding path program 1 times [2024-11-19 01:03:39,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:39,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638449399] [2024-11-19 01:03:39,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:39,194 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-19 01:03:39,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:39,195 INFO L229 MonitoredProcess]: Starting monitored process 18 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-19 01:03:39,196 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 (18)] Waiting until timeout for monitored process [2024-11-19 01:03:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:39,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 01:03:39,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:39,499 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 25 treesize of output 17 [2024-11-19 01:03:39,501 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 13 [2024-11-19 01:03:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:03:39,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:03:39,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:39,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638449399] [2024-11-19 01:03:39,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638449399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:03:39,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:03:39,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:03:39,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209597281] [2024-11-19 01:03:39,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:39,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:03:39,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:39,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:03:39,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:03:39,519 INFO L87 Difference]: Start difference. First operand 286 states and 362 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:41,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:03:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:41,926 INFO L93 Difference]: Finished difference Result 511 states and 647 transitions. [2024-11-19 01:03:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:03:41,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-19 01:03:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:41,929 INFO L225 Difference]: With dead ends: 511 [2024-11-19 01:03:41,929 INFO L226 Difference]: Without dead ends: 288 [2024-11-19 01:03:41,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:03:41,930 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 182 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:41,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 549 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 01:03:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-19 01:03:41,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2024-11-19 01:03:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 234 states have (on average 1.2008547008547008) internal successors, (281), 236 states have internal predecessors, (281), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:03:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 361 transitions. [2024-11-19 01:03:41,963 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 361 transitions. Word has length 140 [2024-11-19 01:03:41,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:41,964 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 361 transitions. [2024-11-19 01:03:41,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:03:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 361 transitions. [2024-11-19 01:03:41,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 01:03:41,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:41,965 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:41,975 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 (18)] Ended with exit code 0 [2024-11-19 01:03:42,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-19 01:03:42,167 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:42,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:42,167 INFO L85 PathProgramCache]: Analyzing trace with hash 900964986, now seen corresponding path program 1 times [2024-11-19 01:03:42,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:42,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763602350] [2024-11-19 01:03:42,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:42,168 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-19 01:03:42,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:42,169 INFO L229 MonitoredProcess]: Starting monitored process 19 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-19 01:03:42,170 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 (19)] Waiting until timeout for monitored process [2024-11-19 01:03:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:42,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 01:03:42,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:42,835 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 42 treesize of output 26 [2024-11-19 01:03:42,846 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-19 01:03:42,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 01:03:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-11-19 01:03:42,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:03:43,181 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-19 01:03:43,181 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 30 treesize of output 25 [2024-11-19 01:03:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-19 01:03:43,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:43,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763602350] [2024-11-19 01:03:43,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763602350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:03:43,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:03:43,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-11-19 01:03:43,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865629053] [2024-11-19 01:03:43,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:03:43,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 01:03:43,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:43,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 01:03:43,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:03:43,273 INFO L87 Difference]: Start difference. First operand 286 states and 361 transitions. Second operand has 24 states, 20 states have (on average 4.85) internal successors, (97), 22 states have internal predecessors, (97), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34)