./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.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 187e608dd7eb0d2f9c48e42a2102391c335d64a7aaf23ffbd5cb60332049f233 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:40:22,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:40:22,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:40:22,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:40:22,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:40:22,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:40:22,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:40:22,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:40:22,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:40:22,779 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:40:22,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:40:22,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:40:22,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:40:22,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:40:22,781 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:40:22,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:40:22,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:40:22,782 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:40:22,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:40:22,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:40:22,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:40:22,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:40:22,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:40:22,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:40:22,786 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:40:22,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:40:22,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:40:22,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:40:22,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:40:22,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:40:22,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:40:22,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:40:22,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:40:22,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:40:22,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:40:22,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:40:22,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:40:22,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:40:22,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:40:22,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:40:22,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:40:22,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:40:22,795 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 -> 187e608dd7eb0d2f9c48e42a2102391c335d64a7aaf23ffbd5cb60332049f233 [2024-10-24 11:40:23,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:40:23,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:40:23,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:40:23,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:40:23,112 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:40:23,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.i [2024-10-24 11:40:24,588 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:40:24,825 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:40:24,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.i [2024-10-24 11:40:24,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b6408a9/6805def1e5a844c19ef1fe77e4e720ba/FLAGdb30b77e0 [2024-10-24 11:40:24,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b6408a9/6805def1e5a844c19ef1fe77e4e720ba [2024-10-24 11:40:24,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:40:24,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:40:24,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:40:24,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:40:24,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:40:24,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:40:24" (1/1) ... [2024-10-24 11:40:24,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d454e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:24, skipping insertion in model container [2024-10-24 11:40:24,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:40:24" (1/1) ... [2024-10-24 11:40:24,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:40:25,080 WARN L248 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-65.i[916,929] [2024-10-24 11:40:25,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:40:25,148 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:40:25,160 WARN L248 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-65.i[916,929] [2024-10-24 11:40:25,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:40:25,209 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:40:25,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25 WrapperNode [2024-10-24 11:40:25,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:40:25,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:40:25,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:40:25,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:40:25,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25" (1/1) ... [2024-10-24 11:40:25,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25" (1/1) ... [2024-10-24 11:40:25,301 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 520 [2024-10-24 11:40:25,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:40:25,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:40:25,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:40:25,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:40:25,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25" (1/1) ... [2024-10-24 11:40:25,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25" (1/1) ... [2024-10-24 11:40:25,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25" (1/1) ... [2024-10-24 11:40:25,367 INFO L175 MemorySlicer]: Split 123 memory accesses to 15 slices as follows [2, 9, 8, 20, 3, 8, 10, 10, 8, 8, 3, 6, 7, 8, 13]. 16 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-10-24 11:40:25,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25" (1/1) ... [2024-10-24 11:40:25,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25" (1/1) ... [2024-10-24 11:40:25,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25" (1/1) ... [2024-10-24 11:40:25,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25" (1/1) ... [2024-10-24 11:40:25,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25" (1/1) ... [2024-10-24 11:40:25,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25" (1/1) ... [2024-10-24 11:40:25,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:40:25,430 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:40:25,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:40:25,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:40:25,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25" (1/1) ... [2024-10-24 11:40:25,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:40:25,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:40:25,471 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-10-24 11:40:25,478 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-10-24 11:40:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:40:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:40:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:40:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:40:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:40:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:40:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:40:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 11:40:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 11:40:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-24 11:40:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-24 11:40:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-24 11:40:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-24 11:40:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-24 11:40:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-24 11:40:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-24 11:40:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:40:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:40:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:40:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:40:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:40:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:40:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-24 11:40:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-24 11:40:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-24 11:40:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-24 11:40:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-24 11:40:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-24 11:40:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-24 11:40:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-24 11:40:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-24 11:40:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:40:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:40:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:40:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:40:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:40:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:40:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-24 11:40:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-24 11:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-24 11:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-24 11:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-24 11:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-24 11:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-24 11:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-24 11:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-24 11:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:40:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:40:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:40:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:40:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:40:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 11:40:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 11:40:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-24 11:40:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-24 11:40:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-24 11:40:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-24 11:40:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-24 11:40:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-24 11:40:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-24 11:40:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:40:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:40:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:40:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:40:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:40:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:40:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-24 11:40:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-24 11:40:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-24 11:40:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-24 11:40:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-24 11:40:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-24 11:40:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-24 11:40:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-24 11:40:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-24 11:40:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:40:25,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:40:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:40:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:40:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:40:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:40:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:40:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:40:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 11:40:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 11:40:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-24 11:40:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-24 11:40:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-24 11:40:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-24 11:40:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-24 11:40:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-24 11:40:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-24 11:40:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:40:25,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:40:25,733 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:40:25,736 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:40:26,362 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-24 11:40:26,363 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:40:26,418 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:40:26,419 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:40:26,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:40:26 BoogieIcfgContainer [2024-10-24 11:40:26,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:40:26,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:40:26,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:40:26,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:40:26,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:40:24" (1/3) ... [2024-10-24 11:40:26,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cafc7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:40:26, skipping insertion in model container [2024-10-24 11:40:26,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:25" (2/3) ... [2024-10-24 11:40:26,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cafc7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:40:26, skipping insertion in model container [2024-10-24 11:40:26,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:40:26" (3/3) ... [2024-10-24 11:40:26,431 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-65.i [2024-10-24 11:40:26,450 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:40:26,450 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:40:26,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:40:26,536 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;@3d085e6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:40:26,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:40:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:40:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:40:26,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:26,558 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:26,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:26,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash -657526747, now seen corresponding path program 1 times [2024-10-24 11:40:26,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:26,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871248371] [2024-10-24 11:40:26,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:26,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:26,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:26,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:26,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:40:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:26,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:26,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:40:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:26,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:26,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:40:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:26,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:40:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:26,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:40:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:40:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:40:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:40:27,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:27,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871248371] [2024-10-24 11:40:27,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871248371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:27,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:27,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:40:27,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543854248] [2024-10-24 11:40:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:27,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:40:27,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:27,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:40:27,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:40:27,072 INFO L87 Difference]: Start difference. First operand has 106 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:40:27,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:27,126 INFO L93 Difference]: Finished difference Result 209 states and 327 transitions. [2024-10-24 11:40:27,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:40:27,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-10-24 11:40:27,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:27,139 INFO L225 Difference]: With dead ends: 209 [2024-10-24 11:40:27,140 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 11:40:27,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-10-24 11:40:27,150 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:27,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:27,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 11:40:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 11:40:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 states have internal predecessors, (130), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:40:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-10-24 11:40:27,202 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 107 [2024-10-24 11:40:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:27,202 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-10-24 11:40:27,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:40:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-10-24 11:40:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:40:27,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:27,209 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:27,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:40:27,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:27,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:27,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1367077855, now seen corresponding path program 1 times [2024-10-24 11:40:27,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:27,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792403837] [2024-10-24 11:40:27,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:27,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:40:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:40:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:40:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:40:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:40:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:40:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:40:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:40:27,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:27,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792403837] [2024-10-24 11:40:27,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792403837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:27,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:27,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:40:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234232459] [2024-10-24 11:40:27,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:27,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:40:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:27,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:40:27,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:27,648 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:40:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:27,720 INFO L93 Difference]: Finished difference Result 209 states and 306 transitions. [2024-10-24 11:40:27,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:40:27,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-10-24 11:40:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:27,722 INFO L225 Difference]: With dead ends: 209 [2024-10-24 11:40:27,722 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 11:40:27,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:27,728 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:27,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 11:40:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-24 11:40:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:40:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-10-24 11:40:27,749 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 107 [2024-10-24 11:40:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:27,753 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-10-24 11:40:27,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:40:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-10-24 11:40:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:40:27,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:27,756 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:27,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:40:27,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:27,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:27,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2044380451, now seen corresponding path program 1 times [2024-10-24 11:40:27,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:27,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102883829] [2024-10-24 11:40:27,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:40:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:40:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:40:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:40:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:40:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:40:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:40:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:40:28,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:28,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102883829] [2024-10-24 11:40:28,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102883829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:28,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:28,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:28,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435467328] [2024-10-24 11:40:28,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:28,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:28,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:28,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:28,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:28,109 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:28,159 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2024-10-24 11:40:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-10-24 11:40:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:28,164 INFO L225 Difference]: With dead ends: 214 [2024-10-24 11:40:28,164 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 11:40:28,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-10-24 11:40:28,168 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:28,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 571 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:28,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 11:40:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-24 11:40:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:40:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-10-24 11:40:28,184 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 107 [2024-10-24 11:40:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:28,186 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-10-24 11:40:28,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-10-24 11:40:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:40:28,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:28,191 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:28,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:40:28,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:28,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash 84875051, now seen corresponding path program 1 times [2024-10-24 11:40:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652974239] [2024-10-24 11:40:28,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:28,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:40:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:40:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:40:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:40:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:40:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:40:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:40:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:40:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:28,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652974239] [2024-10-24 11:40:28,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652974239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:28,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:28,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:40:28,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763761374] [2024-10-24 11:40:28,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:28,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:40:28,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:28,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:40:28,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:28,381 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:28,416 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2024-10-24 11:40:28,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:40:28,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-10-24 11:40:28,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:28,419 INFO L225 Difference]: With dead ends: 220 [2024-10-24 11:40:28,419 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 11:40:28,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:28,421 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:28,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 428 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 11:40:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-24 11:40:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:40:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-10-24 11:40:28,432 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 107 [2024-10-24 11:40:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:28,434 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-10-24 11:40:28,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-10-24 11:40:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:40:28,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:28,436 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:28,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:40:28,437 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:28,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash -724471575, now seen corresponding path program 1 times [2024-10-24 11:40:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:28,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825909950] [2024-10-24 11:40:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:28,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:40:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:40:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:40:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:40:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:40:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:40:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:40:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:40:28,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:28,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825909950] [2024-10-24 11:40:28,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825909950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:28,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:28,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:40:28,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790378690] [2024-10-24 11:40:28,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:28,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:40:28,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:28,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:40:28,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:28,612 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:28,647 INFO L93 Difference]: Finished difference Result 224 states and 321 transitions. [2024-10-24 11:40:28,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:40:28,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-10-24 11:40:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:28,649 INFO L225 Difference]: With dead ends: 224 [2024-10-24 11:40:28,649 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 11:40:28,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:28,651 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:28,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 429 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 11:40:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-24 11:40:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:40:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-10-24 11:40:28,669 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 107 [2024-10-24 11:40:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:28,669 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-10-24 11:40:28,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-10-24 11:40:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:40:28,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:28,671 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:28,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:40:28,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:28,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:28,671 INFO L85 PathProgramCache]: Analyzing trace with hash -667213273, now seen corresponding path program 1 times [2024-10-24 11:40:28,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:28,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875094644] [2024-10-24 11:40:28,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:28,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:40:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:40:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:40:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:40:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:40:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:40:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:40:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:40:28,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:28,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875094644] [2024-10-24 11:40:28,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875094644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:28,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:28,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:40:28,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626066190] [2024-10-24 11:40:28,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:28,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:40:28,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:28,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:40:28,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:28,820 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:28,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:28,856 INFO L93 Difference]: Finished difference Result 228 states and 325 transitions. [2024-10-24 11:40:28,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:40:28,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-10-24 11:40:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:28,858 INFO L225 Difference]: With dead ends: 228 [2024-10-24 11:40:28,858 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 11:40:28,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:28,860 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:28,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 432 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 11:40:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-24 11:40:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 102 states have internal predecessors, (141), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:40:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-10-24 11:40:28,871 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 107 [2024-10-24 11:40:28,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:28,872 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-10-24 11:40:28,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:28,872 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-10-24 11:40:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:40:28,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:28,876 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:28,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:40:28,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:28,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:28,877 INFO L85 PathProgramCache]: Analyzing trace with hash -667153691, now seen corresponding path program 1 times [2024-10-24 11:40:28,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:28,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640817740] [2024-10-24 11:40:28,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:28,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:40:28,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:40:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:40:29,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:40:29,065 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:40:29,066 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:40:29,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:40:29,072 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:29,238 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:40:29,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:40:29 BoogieIcfgContainer [2024-10-24 11:40:29,241 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:40:29,241 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:40:29,241 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:40:29,242 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:40:29,242 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:40:26" (3/4) ... [2024-10-24 11:40:29,244 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:40:29,245 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:40:29,246 INFO L158 Benchmark]: Toolchain (without parser) took 4390.62ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 145.9MB in the beginning and 96.6MB in the end (delta: 49.2MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2024-10-24 11:40:29,246 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory was 83.6MB in the beginning and 83.5MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:40:29,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.08ms. Allocated memory is still 176.2MB. Free memory was 145.2MB in the beginning and 129.8MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:40:29,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.60ms. Allocated memory is still 176.2MB. Free memory was 129.8MB in the beginning and 125.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:40:29,247 INFO L158 Benchmark]: Boogie Preprocessor took 126.70ms. Allocated memory is still 176.2MB. Free memory was 125.6MB in the beginning and 120.0MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:40:29,248 INFO L158 Benchmark]: RCFGBuilder took 989.87ms. Allocated memory is still 176.2MB. Free memory was 120.0MB in the beginning and 122.7MB in the end (delta: -2.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-24 11:40:29,248 INFO L158 Benchmark]: TraceAbstraction took 2819.25ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 121.7MB in the beginning and 96.6MB in the end (delta: 25.1MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2024-10-24 11:40:29,250 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 213.9MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:40:29,252 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.20ms. Allocated memory is still 121.6MB. Free memory was 83.6MB in the beginning and 83.5MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.08ms. Allocated memory is still 176.2MB. Free memory was 145.2MB in the beginning and 129.8MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.60ms. Allocated memory is still 176.2MB. Free memory was 129.8MB in the beginning and 125.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 126.70ms. Allocated memory is still 176.2MB. Free memory was 125.6MB in the beginning and 120.0MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 989.87ms. Allocated memory is still 176.2MB. Free memory was 120.0MB in the beginning and 122.7MB in the end (delta: -2.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2819.25ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 121.7MB in the beginning and 96.6MB in the end (delta: 25.1MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 213.9MB. Free memory is still 96.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 102, overapproximation of someBinaryArithmeticDOUBLEoperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someUnaryFLOAToperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 1000000000.1; [L22] float var_1_1 = 1000000000.1; [L23] float* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_3 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char* var_1_3_Pointer = &(var_1_3); [L26] float var_1_4 = 8.2; [L26] float var_1_4 = 8.2; [L27] float* var_1_4_Pointer = &(var_1_4); [L28] signed long int var_1_5 = -32; [L28] signed long int var_1_5 = -32; [L29] signed long int* var_1_5_Pointer = &(var_1_5); [L30] double var_1_9 = 100.5; [L30] double var_1_9 = 100.5; [L31] double* var_1_9_Pointer = &(var_1_9); [L32] double var_1_12 = 25.25; [L32] double var_1_12 = 25.25; [L33] double* var_1_12_Pointer = &(var_1_12); [L34] double var_1_13 = 63.6; [L34] double var_1_13 = 63.6; [L35] double* var_1_13_Pointer = &(var_1_13); [L36] double var_1_14 = 0.0; [L36] double var_1_14 = 0.0; [L37] double* var_1_14_Pointer = &(var_1_14); [L38] double var_1_15 = 0.8; [L38] double var_1_15 = 0.8; [L39] double* var_1_15_Pointer = &(var_1_15); [L40] signed char var_1_16 = -8; [L40] signed char var_1_16 = -8; [L41] signed char* var_1_16_Pointer = &(var_1_16); [L42] signed char var_1_17 = 8; [L42] signed char var_1_17 = 8; [L43] signed char* var_1_17_Pointer = &(var_1_17); [L44] unsigned short int var_1_18 = 2; [L44] unsigned short int var_1_18 = 2; [L45] unsigned short int* var_1_18_Pointer = &(var_1_18); [L46] unsigned short int var_1_19 = 50; [L46] unsigned short int var_1_19 = 50; [L47] unsigned short int* var_1_19_Pointer = &(var_1_19); [L48] unsigned short int var_1_20 = 0; [L48] unsigned short int var_1_20 = 0; [L49] unsigned short int* var_1_20_Pointer = &(var_1_20); [L50] double last_1_var_1_9 = 100.5; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] CALL updateLastVariables() [L99] EXPR \read(var_1_9) [L99] last_1_var_1_9 = var_1_9 [L109] RET updateLastVariables() [L110] CALL updateVariables() [L78] var_1_3 = __VERIFIER_nondet_uchar() [L79] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] var_1_4 = __VERIFIER_nondet_float() [L82] EXPR \read(var_1_4) [L82] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F [L82] EXPR \read(var_1_4) [L82] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] EXPR (var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] EXPR (var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] var_1_12 = __VERIFIER_nondet_double() [L84] EXPR \read(var_1_12) [L84] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F [L84] EXPR \read(var_1_12) [L84] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] var_1_13 = __VERIFIER_nondet_double() [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] var_1_14 = __VERIFIER_nondet_double() [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] EXPR var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] EXPR (var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] EXPR (var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] var_1_15 = __VERIFIER_nondet_double() [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L91] var_1_17 = __VERIFIER_nondet_char() [L92] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] var_1_19 = __VERIFIER_nondet_ushort() [L95] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L110] RET updateVariables() [L111] CALL step() [L54] COND TRUE 0.625f > last_1_var_1_9 [L55] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L55] COND FALSE !((*(var_1_3_Pointer))) [L61] EXPR \read(*var_1_17_Pointer) [L61] (*(var_1_16_Pointer)) = (*(var_1_17_Pointer)) [L62] EXPR \read(*var_1_19_Pointer) [L62] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L63] EXPR \read(*var_1_19_Pointer) [L63] (*(var_1_20_Pointer)) = (*(var_1_19_Pointer)) [L64] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L64] COND FALSE !((*(var_1_3_Pointer))) [L69] EXPR \read(*var_1_1_Pointer) [L69] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L69] COND TRUE (*(var_1_1_Pointer)) <= (*(var_1_1_Pointer)) [L70] EXPR \read(*var_1_13_Pointer) [L70] EXPR \read(*var_1_14_Pointer) [L70] EXPR \read(*var_1_15_Pointer) [L70] (*(var_1_9_Pointer)) = ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))) [L73] EXPR \read(*var_1_4_Pointer) [L73] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L73] COND FALSE !((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR (0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) [L102] EXPR \read(*var_1_1_Pointer) [L102] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))) [L102] EXPR \read(*var_1_4_Pointer) [L102] EXPR (((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1)) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1)) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102-L103] return ((((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_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_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2439 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1564 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 875 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=6, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 636 ConstructedInterpolants, 0 QuantifiedInterpolants, 650 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1320/1320 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-10-24 11:40:29,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.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 187e608dd7eb0d2f9c48e42a2102391c335d64a7aaf23ffbd5cb60332049f233 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:40:31,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:40:31,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:40:31,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:40:31,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:40:31,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:40:31,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:40:31,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:40:31,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:40:31,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:40:31,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:40:31,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:40:31,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:40:31,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:40:31,615 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:40:31,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:40:31,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:40:31,617 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:40:31,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:40:31,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:40:31,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:40:31,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:40:31,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:40:31,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:40:31,622 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:40:31,622 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:40:31,623 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:40:31,623 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:40:31,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:40:31,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:40:31,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:40:31,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:40:31,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:40:31,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:40:31,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:40:31,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:40:31,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:40:31,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:40:31,627 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:40:31,627 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:40:31,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:40:31,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:40:31,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:40:31,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:40:31,628 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:40:31,628 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 -> 187e608dd7eb0d2f9c48e42a2102391c335d64a7aaf23ffbd5cb60332049f233 [2024-10-24 11:40:31,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:40:31,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:40:32,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:40:32,002 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:40:32,003 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:40:32,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.i [2024-10-24 11:40:33,537 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:40:33,764 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:40:33,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.i [2024-10-24 11:40:33,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e62ba16/8721dbef4aff4b43b0f77596029380fd/FLAG09ef2e604 [2024-10-24 11:40:33,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e62ba16/8721dbef4aff4b43b0f77596029380fd [2024-10-24 11:40:33,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:40:33,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:40:33,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:40:33,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:40:33,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:40:33,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:40:33" (1/1) ... [2024-10-24 11:40:33,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d1bfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:33, skipping insertion in model container [2024-10-24 11:40:33,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:40:33" (1/1) ... [2024-10-24 11:40:33,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:40:34,035 WARN L248 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-65.i[916,929] [2024-10-24 11:40:34,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:40:34,127 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:40:34,138 WARN L248 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-65.i[916,929] [2024-10-24 11:40:34,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:40:34,207 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:40:34,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34 WrapperNode [2024-10-24 11:40:34,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:40:34,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:40:34,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:40:34,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:40:34,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34" (1/1) ... [2024-10-24 11:40:34,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34" (1/1) ... [2024-10-24 11:40:34,284 INFO L138 Inliner]: procedures = 39, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 519 [2024-10-24 11:40:34,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:40:34,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:40:34,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:40:34,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:40:34,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34" (1/1) ... [2024-10-24 11:40:34,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34" (1/1) ... [2024-10-24 11:40:34,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34" (1/1) ... [2024-10-24 11:40:34,355 INFO L175 MemorySlicer]: Split 123 memory accesses to 15 slices as follows [2, 9, 8, 20, 3, 8, 10, 10, 8, 8, 3, 6, 7, 8, 13]. 16 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-10-24 11:40:34,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34" (1/1) ... [2024-10-24 11:40:34,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34" (1/1) ... [2024-10-24 11:40:34,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34" (1/1) ... [2024-10-24 11:40:34,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34" (1/1) ... [2024-10-24 11:40:34,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34" (1/1) ... [2024-10-24 11:40:34,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34" (1/1) ... [2024-10-24 11:40:34,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:40:34,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:40:34,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:40:34,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:40:34,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34" (1/1) ... [2024-10-24 11:40:34,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:40:34,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:40:34,454 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-10-24 11:40:34,456 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-10-24 11:40:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:40:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:40:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:40:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-24 11:40:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-24 11:40:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-24 11:40:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-24 11:40:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-24 11:40:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-24 11:40:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-24 11:40:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-24 11:40:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-10-24 11:40:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-10-24 11:40:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-10-24 11:40:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-10-24 11:40:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-10-24 11:40:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:40:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:40:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-24 11:40:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-24 11:40:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-24 11:40:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-24 11:40:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-24 11:40:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-24 11:40:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-24 11:40:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-24 11:40:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-10-24 11:40:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-10-24 11:40:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-10-24 11:40:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-10-24 11:40:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-10-24 11:40:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:40:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:40:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:40:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:40:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:40:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:40:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-24 11:40:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-24 11:40:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-24 11:40:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-24 11:40:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-24 11:40:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-24 11:40:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-24 11:40:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-24 11:40:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-24 11:40:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:40:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:40:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 11:40:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 11:40:34,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-24 11:40:34,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-24 11:40:34,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-24 11:40:34,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-24 11:40:34,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-24 11:40:34,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-24 11:40:34,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-24 11:40:34,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-24 11:40:34,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-24 11:40:34,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-24 11:40:34,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-10-24 11:40:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:40:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:40:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:40:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:40:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:40:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:40:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-24 11:40:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-24 11:40:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-24 11:40:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-24 11:40:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-24 11:40:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-24 11:40:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-24 11:40:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-24 11:40:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-24 11:40:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:40:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:40:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 11:40:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 11:40:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-24 11:40:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-24 11:40:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-24 11:40:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-24 11:40:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-24 11:40:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-24 11:40:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-24 11:40:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-10-24 11:40:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-10-24 11:40:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-10-24 11:40:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-10-24 11:40:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:40:34,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:40:34,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:40:34,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:40:34,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:40:34,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-24 11:40:34,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-24 11:40:34,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-24 11:40:34,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-24 11:40:34,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-24 11:40:34,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-24 11:40:34,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-24 11:40:34,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-24 11:40:34,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-24 11:40:34,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-24 11:40:34,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:40:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:40:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-24 11:40:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-24 11:40:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-24 11:40:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-24 11:40:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-24 11:40:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-24 11:40:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-24 11:40:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-24 11:40:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-10-24 11:40:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-10-24 11:40:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-10-24 11:40:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-10-24 11:40:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-10-24 11:40:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:40:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:40:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 11:40:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 11:40:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-24 11:40:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-24 11:40:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-24 11:40:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-24 11:40:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-24 11:40:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-24 11:40:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-24 11:40:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-10-24 11:40:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-10-24 11:40:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-10-24 11:40:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-10-24 11:40:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:40:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:40:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 11:40:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 11:40:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-24 11:40:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-24 11:40:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-24 11:40:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-24 11:40:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-24 11:40:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-24 11:40:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-24 11:40:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-24 11:40:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-24 11:40:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-24 11:40:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-10-24 11:40:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:40:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:40:34,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:40:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:40:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:40:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-24 11:40:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-24 11:40:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-24 11:40:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-24 11:40:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-24 11:40:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-24 11:40:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-24 11:40:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-24 11:40:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-24 11:40:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-24 11:40:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:40:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:40:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:40:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:40:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:40:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-24 11:40:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-24 11:40:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-24 11:40:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-24 11:40:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-24 11:40:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-24 11:40:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-24 11:40:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-24 11:40:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-24 11:40:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-24 11:40:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:40:34,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:40:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:40:34,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:40:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:40:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:40:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:40:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:40:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:40:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:40:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-24 11:40:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-24 11:40:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-24 11:40:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-24 11:40:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-24 11:40:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-24 11:40:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-24 11:40:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-24 11:40:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-10-24 11:40:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-10-24 11:40:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-10-24 11:40:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-10-24 11:40:34,891 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:40:34,893 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:40:37,360 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-10-24 11:40:37,361 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:40:37,446 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:40:37,448 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:40:37,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:40:37 BoogieIcfgContainer [2024-10-24 11:40:37,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:40:37,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:40:37,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:40:37,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:40:37,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:40:33" (1/3) ... [2024-10-24 11:40:37,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464f0b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:40:37, skipping insertion in model container [2024-10-24 11:40:37,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:34" (2/3) ... [2024-10-24 11:40:37,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464f0b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:40:37, skipping insertion in model container [2024-10-24 11:40:37,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:40:37" (3/3) ... [2024-10-24 11:40:37,457 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-65.i [2024-10-24 11:40:37,472 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:40:37,472 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:40:37,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:40:37,553 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;@f9d3d36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:40:37,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:40:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:40:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:40:37,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:37,569 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:37,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:37,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:37,574 INFO L85 PathProgramCache]: Analyzing trace with hash -657526747, now seen corresponding path program 1 times [2024-10-24 11:40:37,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:37,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412744481] [2024-10-24 11:40:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:37,586 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-10-24 11:40:37,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:37,588 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-10-24 11:40:37,590 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-10-24 11:40:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:38,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:40:38,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-24 11:40:38,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:40:38,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:40:38,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412744481] [2024-10-24 11:40:38,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412744481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:38,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:38,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:40:38,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785921671] [2024-10-24 11:40:38,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:38,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:40:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:40:38,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:40:38,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:40:38,379 INFO L87 Difference]: Start difference. First operand has 106 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:40:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:38,440 INFO L93 Difference]: Finished difference Result 209 states and 327 transitions. [2024-10-24 11:40:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:40:38,443 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-10-24 11:40:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:38,450 INFO L225 Difference]: With dead ends: 209 [2024-10-24 11:40:38,450 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 11:40:38,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 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-10-24 11:40:38,455 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:38,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 11:40:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 11:40:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 states have internal predecessors, (130), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:40:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-10-24 11:40:38,500 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 107 [2024-10-24 11:40:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:38,501 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-10-24 11:40:38,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:40:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-10-24 11:40:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:40:38,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:38,507 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:38,521 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-10-24 11:40:38,707 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-10-24 11:40:38,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:38,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1367077855, now seen corresponding path program 1 times [2024-10-24 11:40:38,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:38,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479602833] [2024-10-24 11:40:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:38,710 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-10-24 11:40:38,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:38,713 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-10-24 11:40:38,714 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-10-24 11:40:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:39,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:40:39,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-24 11:40:39,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:40:39,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:40:39,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479602833] [2024-10-24 11:40:39,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479602833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:39,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:39,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:40:39,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729573660] [2024-10-24 11:40:39,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:39,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:40:39,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:40:39,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:40:39,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:39,402 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:40:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:39,501 INFO L93 Difference]: Finished difference Result 209 states and 306 transitions. [2024-10-24 11:40:39,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:40:39,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-10-24 11:40:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:39,503 INFO L225 Difference]: With dead ends: 209 [2024-10-24 11:40:39,503 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 11:40:39,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:39,505 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:39,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 11:40:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-24 11:40:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:40:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-10-24 11:40:39,519 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 107 [2024-10-24 11:40:39,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:39,520 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-10-24 11:40:39,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:40:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-10-24 11:40:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:40:39,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:39,526 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:39,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:40:39,727 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-10-24 11:40:39,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:39,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2044380451, now seen corresponding path program 1 times [2024-10-24 11:40:39,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:39,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82436149] [2024-10-24 11:40:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:39,729 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-10-24 11:40:39,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:39,731 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-10-24 11:40:39,732 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-10-24 11:40:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:40,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:40:40,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:40,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:40:40,446 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 56 treesize of output 20 [2024-10-24 11:40:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:40:41,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:40:41,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:40:41,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82436149] [2024-10-24 11:40:41,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82436149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:41,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:41,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:40:41,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273204229] [2024-10-24 11:40:41,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:41,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:40:41,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:40:41,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:40:41,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:41,668 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:45,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:40:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:47,832 INFO L93 Difference]: Finished difference Result 345 states and 498 transitions. [2024-10-24 11:40:47,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:40:47,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-10-24 11:40:47,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:47,835 INFO L225 Difference]: With dead ends: 345 [2024-10-24 11:40:47,835 INFO L226 Difference]: Without dead ends: 240 [2024-10-24 11:40:47,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:47,837 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 194 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:47,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 347 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-24 11:40:47,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-24 11:40:47,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 208. [2024-10-24 11:40:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 183 states have (on average 1.3989071038251366) internal successors, (256), 183 states have internal predecessors, (256), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:40:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 300 transitions. [2024-10-24 11:40:47,875 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 300 transitions. Word has length 107 [2024-10-24 11:40:47,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:47,876 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 300 transitions. [2024-10-24 11:40:47,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 300 transitions. [2024-10-24 11:40:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:40:47,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:47,880 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:47,902 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 (4)] Ended with exit code 0 [2024-10-24 11:40:48,081 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-10-24 11:40:48,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:48,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:48,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1665623778, now seen corresponding path program 1 times [2024-10-24 11:40:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:48,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448694471] [2024-10-24 11:40:48,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:48,083 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-10-24 11:40:48,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:48,089 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-10-24 11:40:48,090 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-10-24 11:40:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:48,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:40:48,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:40:48,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:40:48,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:40:48,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448694471] [2024-10-24 11:40:48,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448694471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:48,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:48,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:48,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748077434] [2024-10-24 11:40:48,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:48,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:48,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:40:48,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:48,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:48,706 INFO L87 Difference]: Start difference. First operand 208 states and 300 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:48,812 INFO L93 Difference]: Finished difference Result 425 states and 613 transitions. [2024-10-24 11:40:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:48,813 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-10-24 11:40:48,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:48,815 INFO L225 Difference]: With dead ends: 425 [2024-10-24 11:40:48,815 INFO L226 Difference]: Without dead ends: 218 [2024-10-24 11:40:48,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 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-10-24 11:40:48,817 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:48,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 562 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-24 11:40:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2024-10-24 11:40:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 191 states have (on average 1.382198952879581) internal successors, (264), 191 states have internal predecessors, (264), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:40:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 308 transitions. [2024-10-24 11:40:48,834 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 308 transitions. Word has length 108 [2024-10-24 11:40:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:48,835 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 308 transitions. [2024-10-24 11:40:48,835 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 308 transitions. [2024-10-24 11:40:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:40:48,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:48,837 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:48,854 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-10-24 11:40:49,037 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-10-24 11:40:49,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:49,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1819996892, now seen corresponding path program 1 times [2024-10-24 11:40:49,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:49,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827281107] [2024-10-24 11:40:49,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:49,039 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-10-24 11:40:49,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:49,043 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-10-24 11:40:49,044 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-10-24 11:40:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:49,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:40:49,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:49,604 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:40:49,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:40:49,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:40:49,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827281107] [2024-10-24 11:40:49,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827281107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:49,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:49,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:40:49,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597877063] [2024-10-24 11:40:49,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:49,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:40:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:40:49,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:40:49,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:49,607 INFO L87 Difference]: Start difference. First operand 216 states and 308 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:49,721 INFO L93 Difference]: Finished difference Result 437 states and 623 transitions. [2024-10-24 11:40:49,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:40:49,722 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-10-24 11:40:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:49,724 INFO L225 Difference]: With dead ends: 437 [2024-10-24 11:40:49,724 INFO L226 Difference]: Without dead ends: 222 [2024-10-24 11:40:49,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 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-10-24 11:40:49,726 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:49,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 693 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-24 11:40:49,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2024-10-24 11:40:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 195 states have (on average 1.3743589743589744) internal successors, (268), 195 states have internal predecessors, (268), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:40:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 312 transitions. [2024-10-24 11:40:49,745 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 312 transitions. Word has length 108 [2024-10-24 11:40:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:49,745 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 312 transitions. [2024-10-24 11:40:49,745 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 312 transitions. [2024-10-24 11:40:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:40:49,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:49,747 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:49,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 11:40:49,951 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-10-24 11:40:49,951 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:49,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1877255194, now seen corresponding path program 1 times [2024-10-24 11:40:49,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:49,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140568125] [2024-10-24 11:40:49,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:49,953 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-10-24 11:40:49,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:49,954 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-10-24 11:40:49,955 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-10-24 11:40:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:50,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:40:50,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:40:50,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:40:50,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:40:50,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140568125] [2024-10-24 11:40:50,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140568125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:50,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:50,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:40:50,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028325524] [2024-10-24 11:40:50,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:50,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:40:50,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:40:50,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:40:50,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:40:50,537 INFO L87 Difference]: Start difference. First operand 220 states and 312 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:50,702 INFO L93 Difference]: Finished difference Result 445 states and 631 transitions. [2024-10-24 11:40:50,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:40:50,703 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-10-24 11:40:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:50,708 INFO L225 Difference]: With dead ends: 445 [2024-10-24 11:40:50,708 INFO L226 Difference]: Without dead ends: 226 [2024-10-24 11:40:50,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 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-10-24 11:40:50,709 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:50,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 826 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-24 11:40:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2024-10-24 11:40:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 199 states have (on average 1.3668341708542713) internal successors, (272), 199 states have internal predecessors, (272), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:40:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 316 transitions. [2024-10-24 11:40:50,724 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 316 transitions. Word has length 108 [2024-10-24 11:40:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:50,725 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 316 transitions. [2024-10-24 11:40:50,725 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 316 transitions. [2024-10-24 11:40:50,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:40:50,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:50,727 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:50,747 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 (7)] Forceful destruction successful, exit code 0 [2024-10-24 11:40:50,927 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-10-24 11:40:50,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:50,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1877314776, now seen corresponding path program 1 times [2024-10-24 11:40:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:50,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274795651] [2024-10-24 11:40:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:50,929 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-10-24 11:40:50,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:50,932 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-10-24 11:40:50,934 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-10-24 11:40:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:51,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 11:40:51,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:51,651 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-10-24 11:40:51,949 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 62 treesize of output 38 [2024-10-24 11:40:52,056 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 74 treesize of output 38 [2024-10-24 11:40:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:40:52,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:40:52,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:40:52,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274795651] [2024-10-24 11:40:52,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274795651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:52,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:52,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:40:52,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982192929] [2024-10-24 11:40:52,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:52,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:40:52,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:40:52,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:40:52,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:40:52,360 INFO L87 Difference]: Start difference. First operand 224 states and 316 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:54,671 INFO L93 Difference]: Finished difference Result 579 states and 804 transitions. [2024-10-24 11:40:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:40:54,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-10-24 11:40:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:54,674 INFO L225 Difference]: With dead ends: 579 [2024-10-24 11:40:54,674 INFO L226 Difference]: Without dead ends: 356 [2024-10-24 11:40:54,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:40:54,676 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 72 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:54,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1221 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 11:40:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-24 11:40:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2024-10-24 11:40:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 321 states have (on average 1.3457943925233644) internal successors, (432), 323 states have internal predecessors, (432), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:40:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 484 transitions. [2024-10-24 11:40:54,696 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 484 transitions. Word has length 108 [2024-10-24 11:40:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:54,696 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 484 transitions. [2024-10-24 11:40:54,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 484 transitions. [2024-10-24 11:40:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:40:54,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:54,698 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:54,720 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-10-24 11:40:54,898 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-10-24 11:40:54,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:54,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:54,900 INFO L85 PathProgramCache]: Analyzing trace with hash 597451098, now seen corresponding path program 1 times [2024-10-24 11:40:54,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:54,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818912192] [2024-10-24 11:40:54,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:54,900 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-10-24 11:40:54,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:54,902 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-10-24 11:40:54,904 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-10-24 11:40:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:55,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:40:55,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:55,545 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 45 treesize of output 21 [2024-10-24 11:40:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:40:55,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:40:55,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:40:55,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818912192] [2024-10-24 11:40:55,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818912192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:55,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:55,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:55,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427260395] [2024-10-24 11:40:55,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:55,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:55,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:40:55,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:55,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:55,590 INFO L87 Difference]: Start difference. First operand 352 states and 484 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:57,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:40:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:59,537 INFO L93 Difference]: Finished difference Result 701 states and 963 transitions. [2024-10-24 11:40:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:59,538 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-10-24 11:40:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:59,541 INFO L225 Difference]: With dead ends: 701 [2024-10-24 11:40:59,541 INFO L226 Difference]: Without dead ends: 350 [2024-10-24 11:40:59,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:59,544 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 66 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:59,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 511 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-24 11:40:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-24 11:40:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 346. [2024-10-24 11:40:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 315 states have (on average 1.3428571428571427) internal successors, (423), 317 states have internal predecessors, (423), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:40:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 475 transitions. [2024-10-24 11:40:59,565 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 475 transitions. Word has length 108 [2024-10-24 11:40:59,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:59,566 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 475 transitions. [2024-10-24 11:40:59,566 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:40:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 475 transitions. [2024-10-24 11:40:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:40:59,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:59,568 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:40:59,586 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-10-24 11:40:59,768 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-10-24 11:40:59,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:59,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:59,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1743301270, now seen corresponding path program 1 times [2024-10-24 11:40:59,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:59,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984561425] [2024-10-24 11:40:59,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:59,770 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-10-24 11:40:59,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:59,771 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-10-24 11:40:59,772 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-10-24 11:41:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:41:00,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:41:00,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:41:00,386 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 46 treesize of output 22 [2024-10-24 11:41:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:41:00,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:41:00,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:41:00,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984561425] [2024-10-24 11:41:00,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984561425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:41:00,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:41:00,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:41:00,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439230243] [2024-10-24 11:41:00,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:41:00,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:41:00,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:41:00,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:41:00,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:41:00,428 INFO L87 Difference]: Start difference. First operand 346 states and 475 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:41:01,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:41:04,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:41:05,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:41:05,371 INFO L93 Difference]: Finished difference Result 758 states and 1035 transitions. [2024-10-24 11:41:05,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:41:05,373 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-10-24 11:41:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:41:05,376 INFO L225 Difference]: With dead ends: 758 [2024-10-24 11:41:05,376 INFO L226 Difference]: Without dead ends: 413 [2024-10-24 11:41:05,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:41:05,377 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 66 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:41:05,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 554 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-24 11:41:05,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-24 11:41:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 327. [2024-10-24 11:41:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 298 states have (on average 1.3456375838926173) internal successors, (401), 299 states have internal predecessors, (401), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:41:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 449 transitions. [2024-10-24 11:41:05,392 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 449 transitions. Word has length 108 [2024-10-24 11:41:05,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:41:05,393 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 449 transitions. [2024-10-24 11:41:05,393 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:41:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 449 transitions. [2024-10-24 11:41:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:41:05,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:41:05,394 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:41:05,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 11:41:05,594 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-10-24 11:41:05,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:41:05,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:41:05,595 INFO L85 PathProgramCache]: Analyzing trace with hash 463437592, now seen corresponding path program 1 times [2024-10-24 11:41:05,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:41:05,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956474260] [2024-10-24 11:41:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:41:05,596 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-10-24 11:41:05,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:41:05,597 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-10-24 11:41:05,598 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-10-24 11:41:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:41:06,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 11:41:06,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:41:07,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2024-10-24 11:41:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-24 11:41:07,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:41:08,504 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:41:08,504 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 74 treesize of output 45 [2024-10-24 11:41:08,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:41:08,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956474260] [2024-10-24 11:41:08,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956474260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:41:08,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [606789165] [2024-10-24 11:41:08,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:41:08,699 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:41:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:41:08,700 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:41:08,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-10-24 11:41:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:41:10,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:41:10,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:41:10,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:41:10,555 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 155 treesize of output 65 [2024-10-24 11:41:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-24 11:41:10,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:41:10,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [606789165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:41:10,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:41:10,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-24 11:41:10,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476042091] [2024-10-24 11:41:10,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:41:10,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:41:10,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:41:10,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:41:10,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:41:10,661 INFO L87 Difference]: Start difference. First operand 327 states and 449 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:41:14,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:41:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:41:14,394 INFO L93 Difference]: Finished difference Result 655 states and 899 transitions. [2024-10-24 11:41:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:41:14,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-10-24 11:41:14,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:41:14,397 INFO L225 Difference]: With dead ends: 655 [2024-10-24 11:41:14,397 INFO L226 Difference]: Without dead ends: 329 [2024-10-24 11:41:14,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:41:14,398 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 134 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:41:14,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 379 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-24 11:41:14,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-24 11:41:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-10-24 11:41:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 298 states have (on average 1.3389261744966443) internal successors, (399), 299 states have internal predecessors, (399), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:41:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 447 transitions. [2024-10-24 11:41:14,414 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 447 transitions. Word has length 108 [2024-10-24 11:41:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:41:14,415 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 447 transitions. [2024-10-24 11:41:14,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:41:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 447 transitions. [2024-10-24 11:41:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 11:41:14,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:41:14,416 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:41:14,436 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-10-24 11:41:14,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-10-24 11:41:14,817 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 11:41:14,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:41:14,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:41:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1152526498, now seen corresponding path program 1 times [2024-10-24 11:41:14,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:41:14,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23641863] [2024-10-24 11:41:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:41:14,819 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-10-24 11:41:14,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:41:14,822 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-10-24 11:41:14,823 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-10-24 11:41:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:41:15,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 11:41:15,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:41:16,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2024-10-24 11:41:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-24 11:41:16,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:41:17,386 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:41:17,387 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 74 treesize of output 45 [2024-10-24 11:41:17,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:41:17,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23641863] [2024-10-24 11:41:17,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23641863] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:41:17,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1623464499] [2024-10-24 11:41:17,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:41:17,539 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:41:17,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:41:17,540 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:41:17,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-10-24 11:41:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:41:19,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:41:19,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:41:19,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:41:19,387 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 155 treesize of output 65 [2024-10-24 11:41:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-24 11:41:19,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:41:19,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1623464499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:41:19,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:41:19,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-24 11:41:19,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172148729] [2024-10-24 11:41:19,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:41:19,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:41:19,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:41:19,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:41:19,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:41:19,477 INFO L87 Difference]: Start difference. First operand 327 states and 447 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:41:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:41:22,640 INFO L93 Difference]: Finished difference Result 655 states and 895 transitions. [2024-10-24 11:41:22,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:41:22,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-10-24 11:41:22,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:41:22,643 INFO L225 Difference]: With dead ends: 655 [2024-10-24 11:41:22,643 INFO L226 Difference]: Without dead ends: 329 [2024-10-24 11:41:22,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:41:22,644 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 125 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:41:22,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 377 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-24 11:41:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-24 11:41:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-10-24 11:41:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 298 states have (on average 1.332214765100671) internal successors, (397), 299 states have internal predecessors, (397), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:41:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 445 transitions. [2024-10-24 11:41:22,660 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 445 transitions. Word has length 110 [2024-10-24 11:41:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:41:22,660 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 445 transitions. [2024-10-24 11:41:22,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:41:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 445 transitions. [2024-10-24 11:41:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 11:41:22,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:41:22,662 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:41:22,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-10-24 11:41:22,881 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-10-24 11:41:23,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-10-24 11:41:23,062 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:41:23,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:41:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash 619721304, now seen corresponding path program 1 times [2024-10-24 11:41:23,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:41:23,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897919190] [2024-10-24 11:41:23,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:41:23,064 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-10-24 11:41:23,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:41:23,066 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-10-24 11:41:23,067 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-10-24 11:41:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:41:23,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 11:41:23,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:41:24,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2024-10-24 11:41:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-24 11:41:24,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:41:25,400 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:41:25,401 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 74 treesize of output 45 [2024-10-24 11:41:25,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:41:25,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897919190] [2024-10-24 11:41:25,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897919190] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:41:25,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1978024899] [2024-10-24 11:41:25,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:41:25,660 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:41:25,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:41:25,661 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:41:25,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-10-24 11:41:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:41:27,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:41:27,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:41:27,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:41:27,649 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 157 treesize of output 67 [2024-10-24 11:41:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 11:41:27,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:41:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1978024899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:41:27,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:41:27,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-24 11:41:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499112579] [2024-10-24 11:41:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:41:27,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:41:27,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:41:27,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:41:27,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:41:27,748 INFO L87 Difference]: Start difference. First operand 327 states and 445 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:41:29,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:41:30,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:41:30,832 INFO L93 Difference]: Finished difference Result 655 states and 891 transitions. [2024-10-24 11:41:30,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:41:30,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-10-24 11:41:30,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:41:30,835 INFO L225 Difference]: With dead ends: 655 [2024-10-24 11:41:30,835 INFO L226 Difference]: Without dead ends: 329 [2024-10-24 11:41:30,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:41:30,837 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 117 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:41:30,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 373 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 11:41:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-24 11:41:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-10-24 11:41:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 298 states have (on average 1.325503355704698) internal successors, (395), 299 states have internal predecessors, (395), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:41:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 443 transitions. [2024-10-24 11:41:30,850 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 443 transitions. Word has length 112 [2024-10-24 11:41:30,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:41:30,850 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 443 transitions. [2024-10-24 11:41:30,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:41:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 443 transitions. [2024-10-24 11:41:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:41:30,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:41:30,852 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:41:30,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-10-24 11:41:31,067 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-10-24 11:41:31,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-10-24 11:41:31,253 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:41:31,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:41:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash 853724318, now seen corresponding path program 1 times [2024-10-24 11:41:31,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:41:31,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068415135] [2024-10-24 11:41:31,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:41:31,254 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-10-24 11:41:31,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:41:31,255 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-10-24 11:41:31,256 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-10-24 11:41:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:41:31,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 11:41:31,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:41:33,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2024-10-24 11:41:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-24 11:41:33,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:41:33,610 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:41:33,610 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 74 treesize of output 45 [2024-10-24 11:41:33,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:41:33,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068415135] [2024-10-24 11:41:33,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068415135] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:41:33,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [788755293] [2024-10-24 11:41:33,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:41:33,776 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:41:33,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:41:33,778 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:41:33,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-10-24 11:41:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:41:35,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:41:35,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:41:35,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:41:35,957 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 155 treesize of output 65 [2024-10-24 11:41:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 11:41:36,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:41:36,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [788755293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:41:36,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:41:36,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-24 11:41:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384108089] [2024-10-24 11:41:36,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:41:36,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:41:36,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:41:36,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:41:36,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:41:36,054 INFO L87 Difference]: Start difference. First operand 327 states and 443 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:41:39,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:41:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:41:39,795 INFO L93 Difference]: Finished difference Result 655 states and 887 transitions. [2024-10-24 11:41:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:41:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2024-10-24 11:41:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:41:39,798 INFO L225 Difference]: With dead ends: 655 [2024-10-24 11:41:39,799 INFO L226 Difference]: Without dead ends: 329 [2024-10-24 11:41:39,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:41:39,800 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 108 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:41:39,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 366 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-24 11:41:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-24 11:41:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-10-24 11:41:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 298 states have (on average 1.3187919463087248) internal successors, (393), 299 states have internal predecessors, (393), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:41:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 441 transitions. [2024-10-24 11:41:39,818 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 441 transitions. Word has length 114 [2024-10-24 11:41:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:41:39,818 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 441 transitions. [2024-10-24 11:41:39,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:41:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 441 transitions. [2024-10-24 11:41:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:41:39,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:41:39,820 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:41:39,838 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 (17)] Forceful destruction successful, exit code 0 [2024-10-24 11:41:40,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-10-24 11:41:40,220 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 11:41:40,221 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:41:40,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:41:40,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1070232984, now seen corresponding path program 1 times [2024-10-24 11:41:40,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:41:40,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338992613] [2024-10-24 11:41:40,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:41:40,222 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-10-24 11:41:40,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:41:40,223 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-10-24 11:41:40,225 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-10-24 11:41:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:41:40,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 11:41:40,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:41:42,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2024-10-24 11:41:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-24 11:41:42,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:41:42,834 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:41:42,835 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 74 treesize of output 45 [2024-10-24 11:41:42,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:41:42,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338992613] [2024-10-24 11:41:42,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338992613] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:41:42,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1013426879] [2024-10-24 11:41:42,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:41:42,995 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:41:42,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:41:42,996 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:41:42,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-10-24 11:41:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:41:44,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:41:44,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:41:45,259 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-10-24 11:41:47,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2024-10-24 11:41:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-24 11:41:47,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:41:47,466 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 52 treesize of output 40 [2024-10-24 11:41:47,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1013426879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:41:47,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:41:47,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-24 11:41:47,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631482323] [2024-10-24 11:41:47,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:41:47,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:41:47,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:41:47,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:41:47,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:41:47,734 INFO L87 Difference]: Start difference. First operand 327 states and 441 transitions. Second operand has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 12 states have internal predecessors, (110), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22)