./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-ap_file-37.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-ap_file-37.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 9ace0252547f876708b624949027ec52b8b774af5160f42fe1d76fcc6574c405 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:26:23,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:26:23,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:26:23,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:26:23,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:26:23,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:26:23,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:26:23,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:26:23,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:26:23,827 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:26:23,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:26:23,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:26:23,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:26:23,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:26:23,833 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:26:23,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:26:23,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:26:23,834 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:26:23,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:26:23,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:26:23,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:26:23,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:26:23,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:26:23,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:26:23,838 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:26:23,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:26:23,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:26:23,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:26:23,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:26:23,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:26:23,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:26:23,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:26:23,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:26:23,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:26:23,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:26:23,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:26:23,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:26:23,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:26:23,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:26:23,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:26:23,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:26:23,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:26:23,853 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 -> 9ace0252547f876708b624949027ec52b8b774af5160f42fe1d76fcc6574c405 [2024-10-24 11:26:24,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:26:24,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:26:24,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:26:24,140 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:26:24,140 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:26:24,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-37.i [2024-10-24 11:26:25,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:26:25,846 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:26:25,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-37.i [2024-10-24 11:26:25,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca222066/a5761dda0b944cabbdea94c241e177ee/FLAG87d1d2935 [2024-10-24 11:26:25,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca222066/a5761dda0b944cabbdea94c241e177ee [2024-10-24 11:26:25,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:26:25,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:26:25,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:26:25,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:26:25,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:26:25,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:26:25" (1/1) ... [2024-10-24 11:26:25,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a351709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:25, skipping insertion in model container [2024-10-24 11:26:25,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:26:25" (1/1) ... [2024-10-24 11:26:25,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:26:26,093 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-ap_file-37.i[917,930] [2024-10-24 11:26:26,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:26:26,199 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:26:26,211 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-ap_file-37.i[917,930] [2024-10-24 11:26:26,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:26:26,273 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:26:26,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:26 WrapperNode [2024-10-24 11:26:26,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:26:26,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:26:26,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:26:26,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:26:26,283 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:26:26" (1/1) ... [2024-10-24 11:26:26,300 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:26:26" (1/1) ... [2024-10-24 11:26:26,339 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2024-10-24 11:26:26,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:26:26,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:26:26,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:26:26,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:26:26,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:26" (1/1) ... [2024-10-24 11:26:26,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:26" (1/1) ... [2024-10-24 11:26:26,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:26" (1/1) ... [2024-10-24 11:26:26,408 INFO L175 MemorySlicer]: Split 124 memory accesses to 8 slices as follows [2, 8, 52, 20, 7, 15, 6, 14]. 42 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 1, 2, 1, 2]. The 17 writes are split as follows [0, 1, 7, 2, 1, 3, 1, 2]. [2024-10-24 11:26:26,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:26" (1/1) ... [2024-10-24 11:26:26,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:26" (1/1) ... [2024-10-24 11:26:26,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:26" (1/1) ... [2024-10-24 11:26:26,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:26" (1/1) ... [2024-10-24 11:26:26,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:26" (1/1) ... [2024-10-24 11:26:26,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:26" (1/1) ... [2024-10-24 11:26:26,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:26:26,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:26:26,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:26:26,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:26:26,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:26" (1/1) ... [2024-10-24 11:26:26,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:26:26,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:26:26,502 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:26:26,506 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:26:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:26:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:26:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:26:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:26:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:26:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:26:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:26:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-24 11:26:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-24 11:26:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:26:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:26:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:26:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:26:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:26:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:26:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 11:26:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 11:26:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:26:26,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:26:26,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:26:26,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:26:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:26:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:26:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-24 11:26:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-24 11:26:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:26:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:26:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:26:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:26:26,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:26:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:26:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 11:26:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 11:26:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:26:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:26:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:26:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:26:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:26:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:26:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-24 11:26:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-24 11:26:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:26:26,567 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:26:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:26:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:26:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:26:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:26:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:26:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:26:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 11:26:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 11:26:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:26:26,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:26:26,754 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:26:26,758 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:26:27,267 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-10-24 11:26:27,268 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:26:27,313 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:26:27,313 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:26:27,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:26:27 BoogieIcfgContainer [2024-10-24 11:26:27,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:26:27,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:26:27,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:26:27,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:26:27,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:26:25" (1/3) ... [2024-10-24 11:26:27,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dff0503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:26:27, skipping insertion in model container [2024-10-24 11:26:27,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:26" (2/3) ... [2024-10-24 11:26:27,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dff0503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:26:27, skipping insertion in model container [2024-10-24 11:26:27,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:26:27" (3/3) ... [2024-10-24 11:26:27,324 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-37.i [2024-10-24 11:26:27,339 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:26:27,339 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:26:27,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:26:27,404 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;@7946363a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:26:27,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:26:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:26:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:26:27,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:27,420 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:27,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:27,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1723426810, now seen corresponding path program 1 times [2024-10-24 11:26:27,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:27,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081184254] [2024-10-24 11:26:27,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:27,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:27,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:27,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081184254] [2024-10-24 11:26:27,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081184254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:27,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:27,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:26:27,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926531795] [2024-10-24 11:26:27,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:27,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:26:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:27,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:26:27,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:26:27,886 INFO L87 Difference]: Start difference. First operand has 98 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:27,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:27,939 INFO L93 Difference]: Finished difference Result 193 states and 307 transitions. [2024-10-24 11:26:27,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:26:27,942 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-10-24 11:26:27,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:27,950 INFO L225 Difference]: With dead ends: 193 [2024-10-24 11:26:27,950 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 11:26:27,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:26:27,956 INFO L432 NwaCegarLoop]: 138 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, 138 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:26:27,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:26:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 11:26:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-24 11:26:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:26:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 142 transitions. [2024-10-24 11:26:28,023 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 142 transitions. Word has length 119 [2024-10-24 11:26:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:28,026 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 142 transitions. [2024-10-24 11:26:28,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 142 transitions. [2024-10-24 11:26:28,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:26:28,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:28,032 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:28,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:26:28,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:28,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:28,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1973893788, now seen corresponding path program 1 times [2024-10-24 11:26:28,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:28,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586982098] [2024-10-24 11:26:28,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:28,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:28,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586982098] [2024-10-24 11:26:28,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586982098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:28,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:28,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:26:28,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188674111] [2024-10-24 11:26:28,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:28,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:26:28,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:28,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:26:28,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:26:28,463 INFO L87 Difference]: Start difference. First operand 96 states and 142 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:28,531 INFO L93 Difference]: Finished difference Result 194 states and 287 transitions. [2024-10-24 11:26:28,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:26:28,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-24 11:26:28,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:28,538 INFO L225 Difference]: With dead ends: 194 [2024-10-24 11:26:28,538 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 11:26:28,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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:26:28,540 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 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:26:28,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:26:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 11:26:28,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-24 11:26:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:26:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2024-10-24 11:26:28,566 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 119 [2024-10-24 11:26:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:28,568 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2024-10-24 11:26:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2024-10-24 11:26:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:26:28,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:28,575 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:28,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:26:28,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:28,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:28,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1164547162, now seen corresponding path program 1 times [2024-10-24 11:26:28,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:28,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877122875] [2024-10-24 11:26:28,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:28,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:28,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:28,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877122875] [2024-10-24 11:26:28,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877122875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:28,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:28,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:26:28,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636980532] [2024-10-24 11:26:28,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:28,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:26:28,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:28,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:26:28,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:26:28,871 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:28,942 INFO L93 Difference]: Finished difference Result 198 states and 291 transitions. [2024-10-24 11:26:28,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:26:28,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-24 11:26:28,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:28,946 INFO L225 Difference]: With dead ends: 198 [2024-10-24 11:26:28,946 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 11:26:28,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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:26:28,948 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 402 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:26:28,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:26:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 11:26:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-24 11:26:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:26:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 146 transitions. [2024-10-24 11:26:28,958 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 146 transitions. Word has length 119 [2024-10-24 11:26:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:28,959 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 146 transitions. [2024-10-24 11:26:28,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 146 transitions. [2024-10-24 11:26:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:26:28,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:28,961 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:28,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:26:28,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:28,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:28,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1164606744, now seen corresponding path program 1 times [2024-10-24 11:26:28,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:28,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750819212] [2024-10-24 11:26:28,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:28,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:30,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:30,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750819212] [2024-10-24 11:26:30,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750819212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:30,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:30,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:26:30,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104946030] [2024-10-24 11:26:30,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:30,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:26:30,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:30,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:26:30,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:26:30,356 INFO L87 Difference]: Start difference. First operand 100 states and 146 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:26:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:30,709 INFO L93 Difference]: Finished difference Result 223 states and 324 transitions. [2024-10-24 11:26:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:26:30,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2024-10-24 11:26:30,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:30,713 INFO L225 Difference]: With dead ends: 223 [2024-10-24 11:26:30,713 INFO L226 Difference]: Without dead ends: 124 [2024-10-24 11:26:30,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:26:30,719 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 290 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:30,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 616 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:26:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-24 11:26:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-10-24 11:26:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 99 states have internal predecessors, (133), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:26:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 177 transitions. [2024-10-24 11:26:30,745 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 177 transitions. Word has length 119 [2024-10-24 11:26:30,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:30,747 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 177 transitions. [2024-10-24 11:26:30,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:26:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 177 transitions. [2024-10-24 11:26:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:26:30,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:30,752 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:30,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:26:30,753 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:30,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:30,753 INFO L85 PathProgramCache]: Analyzing trace with hash 315369379, now seen corresponding path program 1 times [2024-10-24 11:26:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:30,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742346887] [2024-10-24 11:26:30,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:30,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:31,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:31,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742346887] [2024-10-24 11:26:31,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742346887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:31,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:31,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:26:31,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281273285] [2024-10-24 11:26:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:31,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:26:31,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:31,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:26:31,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:26:31,302 INFO L87 Difference]: Start difference. First operand 123 states and 177 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:31,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:31,553 INFO L93 Difference]: Finished difference Result 328 states and 469 transitions. [2024-10-24 11:26:31,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:26:31,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-10-24 11:26:31,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:31,557 INFO L225 Difference]: With dead ends: 328 [2024-10-24 11:26:31,557 INFO L226 Difference]: Without dead ends: 225 [2024-10-24 11:26:31,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:26:31,559 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 411 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:31,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 566 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:26:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-24 11:26:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2024-10-24 11:26:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 180 states have (on average 1.3611111111111112) internal successors, (245), 182 states have internal predecessors, (245), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-24 11:26:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 319 transitions. [2024-10-24 11:26:31,600 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 319 transitions. Word has length 122 [2024-10-24 11:26:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:31,601 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 319 transitions. [2024-10-24 11:26:31,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 319 transitions. [2024-10-24 11:26:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:26:31,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:31,605 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:31,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:26:31,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:31,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:31,606 INFO L85 PathProgramCache]: Analyzing trace with hash -695747871, now seen corresponding path program 1 times [2024-10-24 11:26:31,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:31,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268766863] [2024-10-24 11:26:31,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:31,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:34,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:34,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268766863] [2024-10-24 11:26:34,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268766863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:34,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:34,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:26:34,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713560662] [2024-10-24 11:26:34,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:34,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:26:34,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:34,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:26:34,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:26:34,408 INFO L87 Difference]: Start difference. First operand 222 states and 319 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:35,233 INFO L93 Difference]: Finished difference Result 564 states and 808 transitions. [2024-10-24 11:26:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:26:35,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2024-10-24 11:26:35,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:35,236 INFO L225 Difference]: With dead ends: 564 [2024-10-24 11:26:35,237 INFO L226 Difference]: Without dead ends: 362 [2024-10-24 11:26:35,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:26:35,238 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 544 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:35,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 608 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:26:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-24 11:26:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 358. [2024-10-24 11:26:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 312 states have (on average 1.3974358974358974) internal successors, (436), 316 states have internal predecessors, (436), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 11:26:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 514 transitions. [2024-10-24 11:26:35,296 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 514 transitions. Word has length 122 [2024-10-24 11:26:35,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:35,297 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 514 transitions. [2024-10-24 11:26:35,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 514 transitions. [2024-10-24 11:26:35,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:26:35,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:35,300 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:35,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:26:35,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:35,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:35,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1282553885, now seen corresponding path program 1 times [2024-10-24 11:26:35,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:35,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799383564] [2024-10-24 11:26:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:35,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:36,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:36,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799383564] [2024-10-24 11:26:36,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799383564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:36,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:36,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:26:36,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844042302] [2024-10-24 11:26:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:36,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:26:36,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:36,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:26:36,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:26:36,067 INFO L87 Difference]: Start difference. First operand 358 states and 514 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:36,585 INFO L93 Difference]: Finished difference Result 722 states and 1030 transitions. [2024-10-24 11:26:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:26:36,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-10-24 11:26:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:36,589 INFO L225 Difference]: With dead ends: 722 [2024-10-24 11:26:36,589 INFO L226 Difference]: Without dead ends: 384 [2024-10-24 11:26:36,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:26:36,590 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 378 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:36,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 992 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:26:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-24 11:26:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2024-10-24 11:26:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 323 states have (on average 1.3777089783281733) internal successors, (445), 327 states have internal predecessors, (445), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 11:26:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 543 transitions. [2024-10-24 11:26:36,638 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 543 transitions. Word has length 122 [2024-10-24 11:26:36,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:36,639 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 543 transitions. [2024-10-24 11:26:36,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 543 transitions. [2024-10-24 11:26:36,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:26:36,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:36,641 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:36,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:26:36,641 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:36,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:36,642 INFO L85 PathProgramCache]: Analyzing trace with hash -555199261, now seen corresponding path program 1 times [2024-10-24 11:26:36,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:36,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647292230] [2024-10-24 11:26:36,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:36,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:37,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:37,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647292230] [2024-10-24 11:26:37,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647292230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:37,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:37,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:26:37,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669873719] [2024-10-24 11:26:37,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:37,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:26:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:37,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:26:37,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:26:37,297 INFO L87 Difference]: Start difference. First operand 381 states and 543 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:37,805 INFO L93 Difference]: Finished difference Result 755 states and 1068 transitions. [2024-10-24 11:26:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:26:37,806 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-10-24 11:26:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:37,810 INFO L225 Difference]: With dead ends: 755 [2024-10-24 11:26:37,810 INFO L226 Difference]: Without dead ends: 394 [2024-10-24 11:26:37,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:26:37,812 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 343 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:37,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 983 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:26:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-24 11:26:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 367. [2024-10-24 11:26:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 317 states have (on average 1.3817034700315458) internal successors, (438), 321 states have internal predecessors, (438), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 11:26:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 520 transitions. [2024-10-24 11:26:37,903 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 520 transitions. Word has length 122 [2024-10-24 11:26:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:37,904 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 520 transitions. [2024-10-24 11:26:37,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 520 transitions. [2024-10-24 11:26:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:26:37,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:37,906 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:37,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:26:37,907 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:37,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:37,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1142005275, now seen corresponding path program 1 times [2024-10-24 11:26:37,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:37,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827727391] [2024-10-24 11:26:37,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:37,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:38,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:38,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827727391] [2024-10-24 11:26:38,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827727391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:38,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:38,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:26:38,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051327353] [2024-10-24 11:26:38,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:38,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:26:38,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:38,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:26:38,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:26:38,555 INFO L87 Difference]: Start difference. First operand 367 states and 520 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:38,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:38,903 INFO L93 Difference]: Finished difference Result 726 states and 1020 transitions. [2024-10-24 11:26:38,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:26:38,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-10-24 11:26:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:38,909 INFO L225 Difference]: With dead ends: 726 [2024-10-24 11:26:38,910 INFO L226 Difference]: Without dead ends: 379 [2024-10-24 11:26:38,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:26:38,911 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 273 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:38,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 816 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:26:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-24 11:26:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 281. [2024-10-24 11:26:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 240 states have (on average 1.3875) internal successors, (333), 242 states have internal predecessors, (333), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-24 11:26:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 399 transitions. [2024-10-24 11:26:38,958 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 399 transitions. Word has length 122 [2024-10-24 11:26:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:38,959 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 399 transitions. [2024-10-24 11:26:38,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 399 transitions. [2024-10-24 11:26:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:26:38,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:38,961 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:38,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:26:38,961 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:38,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:38,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2100302627, now seen corresponding path program 1 times [2024-10-24 11:26:38,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:38,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69542149] [2024-10-24 11:26:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:38,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:39,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69542149] [2024-10-24 11:26:39,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69542149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:39,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:39,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:26:39,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630123349] [2024-10-24 11:26:39,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:39,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:26:39,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:39,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:26:39,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:26:39,689 INFO L87 Difference]: Start difference. First operand 281 states and 399 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:40,452 INFO L93 Difference]: Finished difference Result 610 states and 856 transitions. [2024-10-24 11:26:40,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:26:40,453 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-10-24 11:26:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:40,455 INFO L225 Difference]: With dead ends: 610 [2024-10-24 11:26:40,455 INFO L226 Difference]: Without dead ends: 348 [2024-10-24 11:26:40,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:26:40,458 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 224 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:40,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1263 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:26:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-24 11:26:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 279. [2024-10-24 11:26:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 240 states have internal predecessors, (329), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-24 11:26:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 395 transitions. [2024-10-24 11:26:40,502 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 395 transitions. Word has length 122 [2024-10-24 11:26:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:40,502 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 395 transitions. [2024-10-24 11:26:40,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 395 transitions. [2024-10-24 11:26:40,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:26:40,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:40,504 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:40,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:26:40,504 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:40,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:40,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1467310045, now seen corresponding path program 1 times [2024-10-24 11:26:40,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:40,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809272957] [2024-10-24 11:26:40,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:40,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:41,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:41,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809272957] [2024-10-24 11:26:41,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809272957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:41,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:41,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:26:41,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159195984] [2024-10-24 11:26:41,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:41,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:26:41,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:41,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:26:41,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:26:41,098 INFO L87 Difference]: Start difference. First operand 279 states and 395 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:41,577 INFO L93 Difference]: Finished difference Result 601 states and 842 transitions. [2024-10-24 11:26:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:26:41,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-10-24 11:26:41,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:41,581 INFO L225 Difference]: With dead ends: 601 [2024-10-24 11:26:41,582 INFO L226 Difference]: Without dead ends: 342 [2024-10-24 11:26:41,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:26:41,583 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 229 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:41,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1121 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:26:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-24 11:26:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 273. [2024-10-24 11:26:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 232 states have (on average 1.3836206896551724) internal successors, (321), 234 states have internal predecessors, (321), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-24 11:26:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 387 transitions. [2024-10-24 11:26:41,629 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 387 transitions. Word has length 122 [2024-10-24 11:26:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:41,631 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 387 transitions. [2024-10-24 11:26:41,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 387 transitions. [2024-10-24 11:26:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 11:26:41,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:41,632 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:41,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:26:41,632 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:41,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:41,633 INFO L85 PathProgramCache]: Analyzing trace with hash 833889096, now seen corresponding path program 1 times [2024-10-24 11:26:41,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:41,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226324507] [2024-10-24 11:26:41,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:41,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:42,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:42,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226324507] [2024-10-24 11:26:42,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226324507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:42,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:42,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:26:42,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256670933] [2024-10-24 11:26:42,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:42,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:26:42,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:42,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:26:42,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:26:42,374 INFO L87 Difference]: Start difference. First operand 273 states and 387 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:42,708 INFO L93 Difference]: Finished difference Result 530 states and 750 transitions. [2024-10-24 11:26:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:26:42,709 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-10-24 11:26:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:42,712 INFO L225 Difference]: With dead ends: 530 [2024-10-24 11:26:42,713 INFO L226 Difference]: Without dead ends: 277 [2024-10-24 11:26:42,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:26:42,714 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 553 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:42,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 336 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:26:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-24 11:26:42,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-10-24 11:26:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 236 states have (on average 1.3771186440677967) internal successors, (325), 238 states have internal predecessors, (325), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-24 11:26:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 391 transitions. [2024-10-24 11:26:42,760 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 391 transitions. Word has length 124 [2024-10-24 11:26:42,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:42,760 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 391 transitions. [2024-10-24 11:26:42,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 391 transitions. [2024-10-24 11:26:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 11:26:42,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:42,762 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:42,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:26:42,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:42,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 776571212, now seen corresponding path program 1 times [2024-10-24 11:26:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:42,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287075755] [2024-10-24 11:26:42,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:42,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:43,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:44,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:44,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287075755] [2024-10-24 11:26:44,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287075755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:44,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:44,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:26:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739191546] [2024-10-24 11:26:44,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:44,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:26:44,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:44,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:26:44,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:26:44,005 INFO L87 Difference]: Start difference. First operand 277 states and 391 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:44,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:44,463 INFO L93 Difference]: Finished difference Result 308 states and 429 transitions. [2024-10-24 11:26:44,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:26:44,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-10-24 11:26:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:44,466 INFO L225 Difference]: With dead ends: 308 [2024-10-24 11:26:44,467 INFO L226 Difference]: Without dead ends: 306 [2024-10-24 11:26:44,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:26:44,468 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 159 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:44,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 780 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:26:44,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-24 11:26:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 223. [2024-10-24 11:26:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 191 states have (on average 1.3979057591623036) internal successors, (267), 192 states have internal predecessors, (267), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:26:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 319 transitions. [2024-10-24 11:26:44,506 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 319 transitions. Word has length 124 [2024-10-24 11:26:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:44,506 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 319 transitions. [2024-10-24 11:26:44,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 319 transitions. [2024-10-24 11:26:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 11:26:44,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:44,509 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:44,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:26:44,509 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:44,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:44,510 INFO L85 PathProgramCache]: Analyzing trace with hash 776630794, now seen corresponding path program 1 times [2024-10-24 11:26:44,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:44,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747956617] [2024-10-24 11:26:44,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:44,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:44,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:44,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747956617] [2024-10-24 11:26:44,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747956617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:44,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:44,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:26:44,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535924236] [2024-10-24 11:26:44,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:44,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:26:44,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:44,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:26:44,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:26:44,738 INFO L87 Difference]: Start difference. First operand 223 states and 319 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:44,835 INFO L93 Difference]: Finished difference Result 427 states and 609 transitions. [2024-10-24 11:26:44,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:26:44,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-10-24 11:26:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:44,837 INFO L225 Difference]: With dead ends: 427 [2024-10-24 11:26:44,837 INFO L226 Difference]: Without dead ends: 236 [2024-10-24 11:26:44,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:26:44,839 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 114 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:44,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 592 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:26:44,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-24 11:26:44,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 223. [2024-10-24 11:26:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 191 states have (on average 1.3926701570680629) internal successors, (266), 192 states have internal predecessors, (266), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:26:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 318 transitions. [2024-10-24 11:26:44,873 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 318 transitions. Word has length 124 [2024-10-24 11:26:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:44,874 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 318 transitions. [2024-10-24 11:26:44,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 318 transitions. [2024-10-24 11:26:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 11:26:44,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:44,875 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:44,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:26:44,875 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:44,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash 24542470, now seen corresponding path program 1 times [2024-10-24 11:26:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:44,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041736380] [2024-10-24 11:26:44,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:44,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 48 proven. 30 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-10-24 11:26:45,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:45,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041736380] [2024-10-24 11:26:45,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041736380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:26:45,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343424453] [2024-10-24 11:26:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:45,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:26:45,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:26:45,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:26:45,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:26:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:46,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-24 11:26:46,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:26:46,408 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 7 treesize of output 3 [2024-10-24 11:26:47,041 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:26:47,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 11:26:48,347 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:26:48,677 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:26:48,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-24 11:26:48,792 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 15 treesize of output 11 [2024-10-24 11:26:48,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:26:48,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 11:26:48,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:26:48,955 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 15 treesize of output 7 [2024-10-24 11:26:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 25 proven. 267 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-24 11:26:48,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:26:49,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-24 11:26:49,526 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 58 treesize of output 54 [2024-10-24 11:26:50,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343424453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:26:50,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:26:50,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2024-10-24 11:26:50,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589932266] [2024-10-24 11:26:50,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:26:50,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 11:26:50,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:50,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 11:26:50,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 11:26:50,029 INFO L87 Difference]: Start difference. First operand 223 states and 318 transitions. Second operand has 26 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 10 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (30), 9 states have call predecessors, (30), 10 states have call successors, (30) [2024-10-24 11:26:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:52,562 INFO L93 Difference]: Finished difference Result 464 states and 635 transitions. [2024-10-24 11:26:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-24 11:26:52,563 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 10 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (30), 9 states have call predecessors, (30), 10 states have call successors, (30) Word has length 124 [2024-10-24 11:26:52,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:52,565 INFO L225 Difference]: With dead ends: 464 [2024-10-24 11:26:52,565 INFO L226 Difference]: Without dead ends: 273 [2024-10-24 11:26:52,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=671, Invalid=3111, Unknown=0, NotChecked=0, Total=3782 [2024-10-24 11:26:52,568 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 602 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:52,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1737 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:26:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-24 11:26:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 263. [2024-10-24 11:26:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 222 states have (on average 1.3243243243243243) internal successors, (294), 224 states have internal predecessors, (294), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 11:26:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 352 transitions. [2024-10-24 11:26:52,628 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 352 transitions. Word has length 124 [2024-10-24 11:26:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:52,630 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 352 transitions. [2024-10-24 11:26:52,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 10 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (30), 9 states have call predecessors, (30), 10 states have call successors, (30) [2024-10-24 11:26:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 352 transitions. [2024-10-24 11:26:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 11:26:52,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:52,632 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:52,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:26:52,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-24 11:26:52,833 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:52,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash 667906826, now seen corresponding path program 1 times [2024-10-24 11:26:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:52,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974140007] [2024-10-24 11:26:52,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:54,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:54,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974140007] [2024-10-24 11:26:54,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974140007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:54,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:54,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:26:54,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557268171] [2024-10-24 11:26:54,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:54,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:26:54,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:54,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:26:54,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:26:54,009 INFO L87 Difference]: Start difference. First operand 263 states and 352 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:54,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:54,478 INFO L93 Difference]: Finished difference Result 611 states and 815 transitions. [2024-10-24 11:26:54,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:26:54,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-10-24 11:26:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:54,481 INFO L225 Difference]: With dead ends: 611 [2024-10-24 11:26:54,481 INFO L226 Difference]: Without dead ends: 384 [2024-10-24 11:26:54,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:26:54,485 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 205 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:54,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 655 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:26:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-24 11:26:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 306. [2024-10-24 11:26:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 265 states have (on average 1.3283018867924528) internal successors, (352), 267 states have internal predecessors, (352), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 11:26:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 410 transitions. [2024-10-24 11:26:54,551 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 410 transitions. Word has length 124 [2024-10-24 11:26:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:54,551 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 410 transitions. [2024-10-24 11:26:54,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 410 transitions. [2024-10-24 11:26:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 11:26:54,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:54,553 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:54,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:26:54,554 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:54,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:54,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1726275947, now seen corresponding path program 1 times [2024-10-24 11:26:54,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:54,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521343212] [2024-10-24 11:26:54,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:54,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:55,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:55,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521343212] [2024-10-24 11:26:55,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521343212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:55,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:55,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:26:55,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905405664] [2024-10-24 11:26:55,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:55,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:26:55,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:55,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:26:55,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:26:55,084 INFO L87 Difference]: Start difference. First operand 306 states and 410 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:55,361 INFO L93 Difference]: Finished difference Result 695 states and 926 transitions. [2024-10-24 11:26:55,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:26:55,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-10-24 11:26:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:55,364 INFO L225 Difference]: With dead ends: 695 [2024-10-24 11:26:55,364 INFO L226 Difference]: Without dead ends: 425 [2024-10-24 11:26:55,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:26:55,366 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 250 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:55,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 411 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:26:55,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-24 11:26:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 310. [2024-10-24 11:26:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 268 states have (on average 1.3134328358208955) internal successors, (352), 270 states have internal predecessors, (352), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 11:26:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 410 transitions. [2024-10-24 11:26:55,424 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 410 transitions. Word has length 126 [2024-10-24 11:26:55,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:55,424 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 410 transitions. [2024-10-24 11:26:55,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 410 transitions. [2024-10-24 11:26:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 11:26:55,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:55,426 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:55,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:26:55,427 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:55,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:55,427 INFO L85 PathProgramCache]: Analyzing trace with hash -79162387, now seen corresponding path program 1 times [2024-10-24 11:26:55,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:55,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160450425] [2024-10-24 11:26:55,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:26:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:26:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:26:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:26:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:26:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:26:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:26:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:26:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:26:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:26:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:26:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:26:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:26:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 11:26:56,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:56,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160450425] [2024-10-24 11:26:56,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160450425] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:26:56,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890665971] [2024-10-24 11:26:56,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:56,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:26:56,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:26:56,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:26:56,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:26:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-24 11:26:56,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:26:57,562 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:26:58,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 11:26:58,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:26:58,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 11:26:59,158 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:27:00,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:27:00,302 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-10-24 11:27:00,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2024-10-24 11:27:00,475 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2024-10-24 11:27:00,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 38 [2024-10-24 11:27:00,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:27:00,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 64 [2024-10-24 11:27:00,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:27:00,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:27:00,936 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-10-24 11:27:00,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 25 [2024-10-24 11:27:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 17 proven. 323 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-24 11:27:00,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:27:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890665971] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:27:01,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:27:01,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 24] total 37 [2024-10-24 11:27:01,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133434134] [2024-10-24 11:27:01,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:27:01,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-24 11:27:01,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:01,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-24 11:27:01,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1816, Unknown=0, NotChecked=0, Total=1980 [2024-10-24 11:27:01,509 INFO L87 Difference]: Start difference. First operand 310 states and 410 transitions. Second operand has 37 states, 33 states have (on average 3.1818181818181817) internal successors, (105), 32 states have internal predecessors, (105), 9 states have call successors, (30), 6 states have call predecessors, (30), 8 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2024-10-24 11:27:05,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:05,685 INFO L93 Difference]: Finished difference Result 658 states and 863 transitions. [2024-10-24 11:27:05,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-24 11:27:05,686 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 3.1818181818181817) internal successors, (105), 32 states have internal predecessors, (105), 9 states have call successors, (30), 6 states have call predecessors, (30), 8 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) Word has length 126 [2024-10-24 11:27:05,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:05,688 INFO L225 Difference]: With dead ends: 658 [2024-10-24 11:27:05,688 INFO L226 Difference]: Without dead ends: 388 [2024-10-24 11:27:05,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2097 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=909, Invalid=6923, Unknown=0, NotChecked=0, Total=7832 [2024-10-24 11:27:05,692 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 751 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:05,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1349 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 11:27:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-24 11:27:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 326. [2024-10-24 11:27:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 280 states have (on average 1.2964285714285715) internal successors, (363), 282 states have internal predecessors, (363), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 11:27:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 421 transitions. [2024-10-24 11:27:05,755 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 421 transitions. Word has length 126 [2024-10-24 11:27:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:05,756 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 421 transitions. [2024-10-24 11:27:05,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 3.1818181818181817) internal successors, (105), 32 states have internal predecessors, (105), 9 states have call successors, (30), 6 states have call predecessors, (30), 8 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2024-10-24 11:27:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 421 transitions. [2024-10-24 11:27:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 11:27:05,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:05,757 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:05,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:27:05,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-24 11:27:05,958 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:05,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:05,959 INFO L85 PathProgramCache]: Analyzing trace with hash 133966377, now seen corresponding path program 1 times [2024-10-24 11:27:05,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:05,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253535311] [2024-10-24 11:27:05,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:05,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:27:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:27:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:27:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:27:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:27:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:27:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:27:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:27:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:27:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:27:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:27:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:27:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:27:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 11:27:07,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:07,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253535311] [2024-10-24 11:27:07,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253535311] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:27:07,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672397287] [2024-10-24 11:27:07,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:07,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:27:07,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:27:07,510 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:27:07,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 11:27:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 11:27:07,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:27:07,907 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:27:08,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 11:27:08,248 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 15 treesize of output 7 [2024-10-24 11:27:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 22 proven. 203 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-24 11:27:08,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:27:08,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672397287] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:27:08,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:27:08,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 23 [2024-10-24 11:27:08,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513302894] [2024-10-24 11:27:08,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:27:08,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 11:27:08,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:08,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 11:27:08,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2024-10-24 11:27:08,374 INFO L87 Difference]: Start difference. First operand 326 states and 421 transitions. Second operand has 23 states, 20 states have (on average 4.7) internal successors, (94), 22 states have internal predecessors, (94), 10 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 8 states have call predecessors, (30), 10 states have call successors, (30) [2024-10-24 11:27:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:10,304 INFO L93 Difference]: Finished difference Result 491 states and 619 transitions. [2024-10-24 11:27:10,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-24 11:27:10,305 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 4.7) internal successors, (94), 22 states have internal predecessors, (94), 10 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 8 states have call predecessors, (30), 10 states have call successors, (30) Word has length 126 [2024-10-24 11:27:10,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:10,307 INFO L225 Difference]: With dead ends: 491 [2024-10-24 11:27:10,307 INFO L226 Difference]: Without dead ends: 217 [2024-10-24 11:27:10,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=470, Invalid=2182, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 11:27:10,309 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 577 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:10,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1037 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:27:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-24 11:27:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 210. [2024-10-24 11:27:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 166 states have (on average 1.1927710843373494) internal successors, (198), 167 states have internal predecessors, (198), 26 states have call successors, (26), 17 states have call predecessors, (26), 17 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:27:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 250 transitions. [2024-10-24 11:27:10,384 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 250 transitions. Word has length 126 [2024-10-24 11:27:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:10,384 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 250 transitions. [2024-10-24 11:27:10,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 4.7) internal successors, (94), 22 states have internal predecessors, (94), 10 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 8 states have call predecessors, (30), 10 states have call successors, (30) [2024-10-24 11:27:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2024-10-24 11:27:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:27:10,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:10,386 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:10,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:27:10,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:27:10,587 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:10,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:10,587 INFO L85 PathProgramCache]: Analyzing trace with hash 171046096, now seen corresponding path program 1 times [2024-10-24 11:27:10,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:10,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549219426] [2024-10-24 11:27:10,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:10,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:27:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:27:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:27:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:27:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:27:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:27:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:27:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:27:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:27:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:27:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:27:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:27:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:27:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:10,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:10,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549219426] [2024-10-24 11:27:10,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549219426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:10,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:10,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:27:10,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111609315] [2024-10-24 11:27:10,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:10,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:27:10,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:10,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:27:10,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:27:10,775 INFO L87 Difference]: Start difference. First operand 210 states and 250 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:10,856 INFO L93 Difference]: Finished difference Result 368 states and 442 transitions. [2024-10-24 11:27:10,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:27:10,856 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-24 11:27:10,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:10,858 INFO L225 Difference]: With dead ends: 368 [2024-10-24 11:27:10,858 INFO L226 Difference]: Without dead ends: 214 [2024-10-24 11:27:10,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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:27:10,859 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:10,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 629 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:27:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-24 11:27:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2024-10-24 11:27:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 167 states have (on average 1.1916167664670658) internal successors, (199), 168 states have internal predecessors, (199), 26 states have call successors, (26), 17 states have call predecessors, (26), 17 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:27:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2024-10-24 11:27:10,916 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 128 [2024-10-24 11:27:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:10,917 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2024-10-24 11:27:10,917 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2024-10-24 11:27:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:27:10,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:10,918 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:10,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:27:10,918 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:10,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1512685662, now seen corresponding path program 1 times [2024-10-24 11:27:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:10,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277840279] [2024-10-24 11:27:10,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:10,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:27:10,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [90618572] [2024-10-24 11:27:10,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:10,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:27:10,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:27:10,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:27:11,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 11:27:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:11,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-24 11:27:11,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:27:11,569 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:27:11,657 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:27:11,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2024-10-24 11:27:11,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2024-10-24 11:27:11,957 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 11 [2024-10-24 11:27:11,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2024-10-24 11:27:12,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:27:12,242 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-10-24 11:27:12,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 99 [2024-10-24 11:27:12,393 INFO L349 Elim1Store]: treesize reduction 40, result has 51.8 percent of original size [2024-10-24 11:27:12,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 107 [2024-10-24 11:27:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:27:12,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:27:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:12,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:12,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277840279] [2024-10-24 11:27:12,903 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:27:12,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90618572] [2024-10-24 11:27:12,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90618572] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:27:12,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:27:12,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-10-24 11:27:12,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465919734] [2024-10-24 11:27:12,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:12,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:27:12,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:12,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:27:12,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:27:12,904 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:13,365 INFO L93 Difference]: Finished difference Result 377 states and 455 transitions. [2024-10-24 11:27:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:27:13,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-24 11:27:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:13,367 INFO L225 Difference]: With dead ends: 377 [2024-10-24 11:27:13,367 INFO L226 Difference]: Without dead ends: 222 [2024-10-24 11:27:13,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:27:13,368 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 45 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:13,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 406 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:27:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-24 11:27:13,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2024-10-24 11:27:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 173 states have (on average 1.1965317919075145) internal successors, (207), 174 states have internal predecessors, (207), 26 states have call successors, (26), 17 states have call predecessors, (26), 17 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:27:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 259 transitions. [2024-10-24 11:27:13,452 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 259 transitions. Word has length 130 [2024-10-24 11:27:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:13,452 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 259 transitions. [2024-10-24 11:27:13,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 259 transitions. [2024-10-24 11:27:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:27:13,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:13,454 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:13,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 11:27:13,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:27:13,655 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:13,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1653234272, now seen corresponding path program 1 times [2024-10-24 11:27:13,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:13,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12659382] [2024-10-24 11:27:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:13,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:27:13,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2068789779] [2024-10-24 11:27:13,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:13,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:27:13,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:27:13,743 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:27:13,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 11:27:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:14,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-24 11:27:14,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:27:14,208 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:27:14,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 11:27:14,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2024-10-24 11:27:14,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2024-10-24 11:27:14,695 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 11 [2024-10-24 11:27:14,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2024-10-24 11:27:14,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:27:14,860 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-10-24 11:27:14,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 88 [2024-10-24 11:27:14,993 INFO L349 Elim1Store]: treesize reduction 40, result has 51.8 percent of original size [2024-10-24 11:27:14,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 101 [2024-10-24 11:27:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 24 proven. 200 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-10-24 11:27:15,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:27:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:15,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:15,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12659382] [2024-10-24 11:27:15,472 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:27:15,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068789779] [2024-10-24 11:27:15,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068789779] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:27:15,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:27:15,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-10-24 11:27:15,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968370269] [2024-10-24 11:27:15,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:15,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:27:15,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:15,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:27:15,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:27:15,474 INFO L87 Difference]: Start difference. First operand 217 states and 259 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:15,836 INFO L93 Difference]: Finished difference Result 378 states and 455 transitions. [2024-10-24 11:27:15,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:27:15,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-24 11:27:15,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:15,839 INFO L225 Difference]: With dead ends: 378 [2024-10-24 11:27:15,839 INFO L226 Difference]: Without dead ends: 214 [2024-10-24 11:27:15,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:27:15,840 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 5 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:15,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 416 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:27:15,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-24 11:27:15,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-10-24 11:27:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 170 states have (on average 1.1941176470588235) internal successors, (203), 171 states have internal predecessors, (203), 26 states have call successors, (26), 17 states have call predecessors, (26), 17 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:27:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 255 transitions. [2024-10-24 11:27:15,919 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 255 transitions. Word has length 130 [2024-10-24 11:27:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:15,919 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 255 transitions. [2024-10-24 11:27:15,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 255 transitions. [2024-10-24 11:27:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:27:15,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:15,921 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:15,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 11:27:16,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-24 11:27:16,122 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:16,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:16,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1535317916, now seen corresponding path program 1 times [2024-10-24 11:27:16,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:16,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392621725] [2024-10-24 11:27:16,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:16,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:27:16,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749614549] [2024-10-24 11:27:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:16,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:27:16,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:27:16,198 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:27:16,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 11:27:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 11:27:16,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:27:16,635 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:27:16,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 11:27:16,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2024-10-24 11:27:16,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2024-10-24 11:27:16,908 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 23 treesize of output 15 [2024-10-24 11:27:16,915 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:27:16,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2024-10-24 11:27:17,062 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-10-24 11:27:17,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32 [2024-10-24 11:27:17,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2024-10-24 11:27:17,180 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-24 11:27:17,180 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 40 treesize of output 16 [2024-10-24 11:27:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 24 proven. 200 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-10-24 11:27:17,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:27:17,608 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 53 treesize of output 49 [2024-10-24 11:27:17,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:27:17,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 65 [2024-10-24 11:27:17,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-24 11:27:17,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2024-10-24 11:27:17,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:17,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392621725] [2024-10-24 11:27:17,867 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:27:17,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749614549] [2024-10-24 11:27:17,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749614549] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:27:17,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:27:17,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-24 11:27:17,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707742177] [2024-10-24 11:27:17,868 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 11:27:17,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:27:17,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:17,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:27:17,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:27:17,869 INFO L87 Difference]: Start difference. First operand 214 states and 255 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:27:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:18,564 INFO L93 Difference]: Finished difference Result 395 states and 473 transitions. [2024-10-24 11:27:18,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:27:18,565 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 130 [2024-10-24 11:27:18,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:18,567 INFO L225 Difference]: With dead ends: 395 [2024-10-24 11:27:18,567 INFO L226 Difference]: Without dead ends: 237 [2024-10-24 11:27:18,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:27:18,568 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 220 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:18,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 742 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:27:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-24 11:27:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 216. [2024-10-24 11:27:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 172 states have (on average 1.191860465116279) internal successors, (205), 173 states have internal predecessors, (205), 26 states have call successors, (26), 17 states have call predecessors, (26), 17 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:27:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 257 transitions. [2024-10-24 11:27:18,636 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 257 transitions. Word has length 130 [2024-10-24 11:27:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:18,636 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 257 transitions. [2024-10-24 11:27:18,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:27:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 257 transitions. [2024-10-24 11:27:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:27:18,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:18,637 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:18,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 11:27:18,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:27:18,838 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:18,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash -153625826, now seen corresponding path program 1 times [2024-10-24 11:27:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:18,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611722025] [2024-10-24 11:27:18,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:18,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:27:18,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051866791] [2024-10-24 11:27:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:18,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:27:18,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:27:18,906 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:27:18,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 11:27:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:27:19,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:27:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:27:19,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:27:19,868 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:27:19,869 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:27:19,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-24 11:27:20,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:27:20,075 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:20,235 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:27:20,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:27:20 BoogieIcfgContainer [2024-10-24 11:27:20,238 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:27:20,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:27:20,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:27:20,239 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:27:20,239 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:26:27" (3/4) ... [2024-10-24 11:27:20,245 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:27:20,246 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:27:20,247 INFO L158 Benchmark]: Toolchain (without parser) took 54375.22ms. Allocated memory was 182.5MB in the beginning and 815.8MB in the end (delta: 633.3MB). Free memory was 123.8MB in the beginning and 457.8MB in the end (delta: -334.0MB). Peak memory consumption was 300.4MB. Max. memory is 16.1GB. [2024-10-24 11:27:20,247 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 182.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:27:20,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.55ms. Allocated memory is still 182.5MB. Free memory was 123.6MB in the beginning and 107.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:27:20,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.13ms. Allocated memory is still 182.5MB. Free memory was 107.0MB in the beginning and 103.0MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:27:20,247 INFO L158 Benchmark]: Boogie Preprocessor took 120.87ms. Allocated memory was 182.5MB in the beginning and 237.0MB in the end (delta: 54.5MB). Free memory was 102.8MB in the beginning and 206.0MB in the end (delta: -103.2MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-10-24 11:27:20,248 INFO L158 Benchmark]: RCFGBuilder took 852.05ms. Allocated memory is still 237.0MB. Free memory was 206.0MB in the beginning and 159.9MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-24 11:27:20,248 INFO L158 Benchmark]: TraceAbstraction took 52921.73ms. Allocated memory was 237.0MB in the beginning and 815.8MB in the end (delta: 578.8MB). Free memory was 159.9MB in the beginning and 458.9MB in the end (delta: -299.0MB). Peak memory consumption was 280.7MB. Max. memory is 16.1GB. [2024-10-24 11:27:20,248 INFO L158 Benchmark]: Witness Printer took 7.86ms. Allocated memory is still 815.8MB. Free memory is still 457.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:27:20,249 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.18ms. Allocated memory is still 182.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.55ms. Allocated memory is still 182.5MB. Free memory was 123.6MB in the beginning and 107.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.13ms. Allocated memory is still 182.5MB. Free memory was 107.0MB in the beginning and 103.0MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.87ms. Allocated memory was 182.5MB in the beginning and 237.0MB in the end (delta: 54.5MB). Free memory was 102.8MB in the beginning and 206.0MB in the end (delta: -103.2MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * RCFGBuilder took 852.05ms. Allocated memory is still 237.0MB. Free memory was 206.0MB in the beginning and 159.9MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 52921.73ms. Allocated memory was 237.0MB in the beginning and 815.8MB in the end (delta: 578.8MB). Free memory was 159.9MB in the beginning and 458.9MB in the end (delta: -299.0MB). Peak memory consumption was 280.7MB. Max. memory is 16.1GB. * Witness Printer took 7.86ms. Allocated memory is still 815.8MB. Free memory is still 457.8MB. 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 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[1] = { 25.1 }; [L22-L24] float float_Array_0[1] = { 25.1 }; [L25] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L26-L28] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L26-L28] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L26-L28] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L26-L28] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L26-L28] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L26-L28] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L29] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L30] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1]); [L31] signed char* signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer = &(signed_char_Array_0[2]); [L32] signed char* signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer = &(signed_char_Array_0[3]); [L33] signed char* signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer = &(signed_char_Array_0[4]); [L34-L36] signed long int signed_long_int_Array_0[2] = { -128, 256 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { -128, 256 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { -128, 256 }; [L37] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L38] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer = &(signed_long_int_Array_0[1]); [L39-L41] signed short int signed_short_int_Array_0[1] = { -16 }; [L39-L41] signed short int signed_short_int_Array_0[1] = { -16 }; [L42] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L43-L45] unsigned char unsigned_char_Array_0[2] = { 16, 8 }; [L43-L45] unsigned char unsigned_char_Array_0[2] = { 16, 8 }; [L43-L45] unsigned char unsigned_char_Array_0[2] = { 16, 8 }; [L46] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L47] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L48-L50] unsigned long int unsigned_long_int_Array_0[1] = { 2531521428 }; [L48-L50] unsigned long int unsigned_long_int_Array_0[1] = { 2531521428 }; [L51] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0]); [L52-L54] unsigned short int unsigned_short_int_Array_0[2] = { 100, 59049 }; [L52-L54] unsigned short int unsigned_short_int_Array_0[2] = { 100, 59049 }; [L52-L54] unsigned short int unsigned_short_int_Array_0[2] = { 100, 59049 }; [L55] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L56] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] FCALL updateLastVariables() [L119] CALL updateVariables() [L84] float_Array_0[0] = __VERIFIER_nondet_float() [L85] EXPR float_Array_0[0] [L85] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L85] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L85] EXPR float_Array_0[0] [L85] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L85] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L85] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L85] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L85] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L86] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L87] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L88] EXPR signed_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0] <= 31) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L88] RET assume_abort_if_not(signed_char_Array_0[0] <= 31) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L89] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L90] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L90] CALL assume_abort_if_not(signed_char_Array_0[1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L90] RET assume_abort_if_not(signed_char_Array_0[1] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L91] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L91] CALL assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L91] RET assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L92] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L93] EXPR signed_char_Array_0[2] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L93] CALL assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L93] RET assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L94] EXPR signed_char_Array_0[2] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L94] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L94] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L95] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L96] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L97] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L98] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L99] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L99] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L99] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L100] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L101] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L102] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L102] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L102] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L103] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L103] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L103] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L104] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L105] EXPR unsigned_short_int_Array_0[1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L105] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L105] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L106] EXPR unsigned_short_int_Array_0[1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L106] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L106] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L119] RET updateVariables() [L120] CALL step() [L60] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L60] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) = (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) [L61] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L61] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) = (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) [L62] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L62] EXPR (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L62] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L62] EXPR (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L62] signed long int stepLocal_0 = ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))); [L63] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L63] COND FALSE !((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= stepLocal_0) [L66] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L66] (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) = (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) [L68] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L68] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) [L69] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L69] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L69] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) [L69] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L69] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L69] COND FALSE !((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) [L72] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L72] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) [L74] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L74] unsigned char stepLocal_1 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)); [L75] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L75] COND FALSE !(2.75f > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) [L78] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) [L78] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L78] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L78] EXPR (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) [L78] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L78] EXPR (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, stepLocal_1=6, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L78] COND TRUE ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) > stepLocal_1 [L79] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L79] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5)) [L79] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L79] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5)) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L79] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L79] EXPR (((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) [L79] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L79] EXPR (((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L79] (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) = (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L111] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L111] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) [L111] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) [L111] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L111] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L111] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) [L111] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L111] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L111] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L111] EXPR (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) [L111] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer) [L111] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L111] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) && ((2.75f > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : ((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1)) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) && ((2.75f > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : ((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1)) [L111] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR (2.75f > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : ((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1) [L111] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer) [L111] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L111] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L111] EXPR (2.75f > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : ((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) && ((2.75f > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : ((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1)) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) && ((2.75f > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : ((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) && ((2.75f > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : ((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) && ((2.75f > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : ((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) && ((2.75f > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : ((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR (((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) && ((2.75f > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : ((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111] EXPR (((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) && ((2.75f > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : ((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L111-L112] return (((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ^ ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) <= -64) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) <= (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) - (1 + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) && ((2.75f > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : ((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < ((1 + 5))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((1 + 5))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] [L19] reach_error() VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={5:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={5:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={5:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={5:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={5:4}, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={10:2}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.7s, OverallIterations: 24, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6178 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6175 mSDsluCounter, 16993 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13692 mSDsCounter, 991 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9093 IncrementalHoareTripleChecker+Invalid, 10084 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 991 mSolverCounterUnsat, 3301 mSDtfsCounter, 9093 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2227 GetRequests, 1848 SyntacticMatches, 0 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3592 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381occurred in iteration=7, InterpolantAutomatonStates: 242, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 673 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 28.8s InterpolantComputationTime, 3872 NumberOfCodeBlocks, 3872 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 3454 ConstructedInterpolants, 34 QuantifiedInterpolants, 32453 SizeOfPredicates, 94 NumberOfNonLiveVariables, 3356 ConjunctsInSsa, 255 ConjunctsInUnsatCore, 28 InterpolantComputations, 19 PerfectInterpolantSequences, 10319/11760 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:27:20,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-ap_file-37.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 9ace0252547f876708b624949027ec52b8b774af5160f42fe1d76fcc6574c405 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:27:22,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:27:22,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:27:22,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:27:22,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:27:22,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:27:22,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:27:22,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:27:22,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:27:22,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:27:22,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:27:22,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:27:22,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:27:22,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:27:22,579 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:27:22,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:27:22,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:27:22,580 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:27:22,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:27:22,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:27:22,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:27:22,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:27:22,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:27:22,584 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:27:22,585 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:27:22,585 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:27:22,585 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:27:22,585 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:27:22,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:27:22,586 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:27:22,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:27:22,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:27:22,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:27:22,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:27:22,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:27:22,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:27:22,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:27:22,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:27:22,588 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:27:22,588 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:27:22,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:27:22,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:27:22,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:27:22,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:27:22,590 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:27:22,590 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 -> 9ace0252547f876708b624949027ec52b8b774af5160f42fe1d76fcc6574c405 [2024-10-24 11:27:22,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:27:22,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:27:22,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:27:22,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:27:22,943 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:27:22,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-37.i [2024-10-24 11:27:24,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:27:24,739 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:27:24,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-37.i [2024-10-24 11:27:24,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb830a84/2cf01e1a05754bb1b6de049b971c08e4/FLAGac0df85ad [2024-10-24 11:27:24,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb830a84/2cf01e1a05754bb1b6de049b971c08e4 [2024-10-24 11:27:24,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:27:24,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:27:24,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:27:24,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:27:24,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:27:24,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:27:24" (1/1) ... [2024-10-24 11:27:24,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1238f2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:24, skipping insertion in model container [2024-10-24 11:27:24,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:27:24" (1/1) ... [2024-10-24 11:27:24,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:27:25,012 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-ap_file-37.i[917,930] [2024-10-24 11:27:25,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:27:25,118 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:27:25,132 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-ap_file-37.i[917,930] [2024-10-24 11:27:25,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:27:25,203 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:27:25,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:25 WrapperNode [2024-10-24 11:27:25,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:27:25,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:27:25,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:27:25,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:27:25,212 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:27:25" (1/1) ... [2024-10-24 11:27:25,235 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:27:25" (1/1) ... [2024-10-24 11:27:25,278 INFO L138 Inliner]: procedures = 36, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 467 [2024-10-24 11:27:25,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:27:25,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:27:25,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:27:25,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:27:25,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:25" (1/1) ... [2024-10-24 11:27:25,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:25" (1/1) ... [2024-10-24 11:27:25,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:25" (1/1) ... [2024-10-24 11:27:25,339 INFO L175 MemorySlicer]: Split 124 memory accesses to 8 slices as follows [2, 8, 52, 20, 7, 15, 6, 14]. 42 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 1, 2, 1, 2]. The 17 writes are split as follows [0, 1, 7, 2, 1, 3, 1, 2]. [2024-10-24 11:27:25,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:25" (1/1) ... [2024-10-24 11:27:25,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:25" (1/1) ... [2024-10-24 11:27:25,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:25" (1/1) ... [2024-10-24 11:27:25,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:25" (1/1) ... [2024-10-24 11:27:25,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:25" (1/1) ... [2024-10-24 11:27:25,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:25" (1/1) ... [2024-10-24 11:27:25,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:27:25,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:27:25,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:27:25,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:27:25,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:25" (1/1) ... [2024-10-24 11:27:25,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:27:25,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:27:25,464 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:27:25,466 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:27:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:27:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:27:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:27:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:27:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:27:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:27:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:27:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-24 11:27:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-24 11:27:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:27:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:27:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 11:27:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 11:27:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-24 11:27:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-24 11:27:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-24 11:27:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-24 11:27:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:27:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:27:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:27:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:27:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:27:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:27:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-24 11:27:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-24 11:27:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:27:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:27:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 11:27:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 11:27:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-24 11:27:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-24 11:27:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-24 11:27:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-24 11:27:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:27:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:27:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:27:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:27:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:27:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-24 11:27:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-24 11:27:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-24 11:27:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:27:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:27:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 11:27:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 11:27:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-24 11:27:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-24 11:27:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-24 11:27:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-24 11:27:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:27:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:27:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 11:27:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 11:27:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-24 11:27:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-24 11:27:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-24 11:27:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-24 11:27:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:27:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:27:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:27:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:27:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:27:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-24 11:27:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-24 11:27:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-24 11:27:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:27:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:27:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:27:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:27:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:27:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-24 11:27:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-24 11:27:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-24 11:27:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:27:25,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:27:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:27:25,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:27:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:27:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:27:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:27:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:27:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:27:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:27:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-24 11:27:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-24 11:27:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:27:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:27:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 11:27:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 11:27:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-24 11:27:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-24 11:27:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-24 11:27:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-24 11:27:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:27:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:27:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 11:27:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 11:27:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-24 11:27:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-24 11:27:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-24 11:27:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-24 11:27:25,762 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:27:25,764 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:27:26,410 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-24 11:27:26,411 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:27:26,482 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:27:26,484 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:27:26,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:27:26 BoogieIcfgContainer [2024-10-24 11:27:26,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:27:26,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:27:26,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:27:26,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:27:26,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:27:24" (1/3) ... [2024-10-24 11:27:26,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5034d018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:27:26, skipping insertion in model container [2024-10-24 11:27:26,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:25" (2/3) ... [2024-10-24 11:27:26,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5034d018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:27:26, skipping insertion in model container [2024-10-24 11:27:26,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:27:26" (3/3) ... [2024-10-24 11:27:26,493 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-37.i [2024-10-24 11:27:26,509 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:27:26,510 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:27:26,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:27:26,583 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;@7e6fc227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:27:26,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:27:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:27:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:27:26,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:26,604 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:26,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:26,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:26,611 INFO L85 PathProgramCache]: Analyzing trace with hash 466555047, now seen corresponding path program 1 times [2024-10-24 11:27:26,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:27:26,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318661906] [2024-10-24 11:27:26,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:26,628 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:27:26,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:27:26,631 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:27:26,650 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:27:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:27:27,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:27:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-24 11:27:27,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:27:27,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:27:27,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318661906] [2024-10-24 11:27:27,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318661906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:27,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:27,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:27:27,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277312207] [2024-10-24 11:27:27,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:27,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:27:27,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:27:27,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:27:27,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:27:27,128 INFO L87 Difference]: Start difference. First operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:27,187 INFO L93 Difference]: Finished difference Result 177 states and 279 transitions. [2024-10-24 11:27:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:27:27,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2024-10-24 11:27:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:27,198 INFO L225 Difference]: With dead ends: 177 [2024-10-24 11:27:27,199 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 11:27:27,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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:27:27,208 INFO L432 NwaCegarLoop]: 124 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, 124 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:27:27,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:27:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 11:27:27,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 11:27:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:27:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-24 11:27:27,258 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 117 [2024-10-24 11:27:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:27,259 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-24 11:27:27,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-24 11:27:27,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:27:27,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:27,263 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:27,273 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:27:27,464 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:27:27,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:27,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:27,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1678433335, now seen corresponding path program 1 times [2024-10-24 11:27:27,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:27:27,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025988019] [2024-10-24 11:27:27,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:27,467 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:27:27,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:27:27,470 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:27:27,471 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:27:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:27:27,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:27:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:27,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:27:27,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:27:27,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025988019] [2024-10-24 11:27:27,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025988019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:27,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:27,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:27:27,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331844643] [2024-10-24 11:27:27,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:27,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:27:27,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:27:27,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:27:27,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:27:27,855 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:27,944 INFO L93 Difference]: Finished difference Result 180 states and 262 transitions. [2024-10-24 11:27:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:27:27,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-24 11:27:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:27,947 INFO L225 Difference]: With dead ends: 180 [2024-10-24 11:27:27,947 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:27:27,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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:27:27,949 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 466 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:27:27,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 466 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:27:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:27:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-24 11:27:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:27:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-24 11:27:27,962 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 117 [2024-10-24 11:27:27,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:27,965 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-24 11:27:27,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-24 11:27:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:27:27,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:27,967 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:27,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:27:28,168 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:27:28,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:28,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1807187335, now seen corresponding path program 1 times [2024-10-24 11:27:28,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:27:28,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189521197] [2024-10-24 11:27:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:28,171 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:27:28,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:27:28,173 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:27:28,174 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:27:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:27:28,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:27:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:28,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:27:28,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:27:28,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189521197] [2024-10-24 11:27:28,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189521197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:28,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:28,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:27:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048043379] [2024-10-24 11:27:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:28,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:27:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:27:28,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:27:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:27:28,566 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:28,682 INFO L93 Difference]: Finished difference Result 186 states and 267 transitions. [2024-10-24 11:27:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:27:28,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-24 11:27:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:28,684 INFO L225 Difference]: With dead ends: 186 [2024-10-24 11:27:28,684 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 11:27:28,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 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:27:28,689 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 573 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:27:28,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 573 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:27:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 11:27:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-24 11:27:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:27:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-10-24 11:27:28,706 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 117 [2024-10-24 11:27:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:28,710 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-10-24 11:27:28,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-10-24 11:27:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:27:28,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:28,712 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:28,724 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:27:28,916 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:27:28,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:28,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:28,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1864445637, now seen corresponding path program 1 times [2024-10-24 11:27:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:27:28,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214199641] [2024-10-24 11:27:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:28,919 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:27:28,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:27:28,922 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:27:28,923 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:27:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:27:29,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:27:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:29,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:27:29,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:27:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214199641] [2024-10-24 11:27:29,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214199641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:29,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:29,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:27:29,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112708549] [2024-10-24 11:27:29,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:29,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:27:29,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:27:29,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:27:29,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:27:29,294 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:29,400 INFO L93 Difference]: Finished difference Result 190 states and 271 transitions. [2024-10-24 11:27:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:27:29,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-24 11:27:29,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:29,403 INFO L225 Difference]: With dead ends: 190 [2024-10-24 11:27:29,403 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 11:27:29,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 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:27:29,405 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 682 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:27:29,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 682 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:27:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 11:27:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-24 11:27:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:27:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 136 transitions. [2024-10-24 11:27:29,413 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 136 transitions. Word has length 117 [2024-10-24 11:27:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:29,414 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 136 transitions. [2024-10-24 11:27:29,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2024-10-24 11:27:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:27:29,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:29,416 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:29,428 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 (5)] Ended with exit code 0 [2024-10-24 11:27:29,617 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:27:29,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:29,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:29,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1864505219, now seen corresponding path program 1 times [2024-10-24 11:27:29,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:27:29,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480557198] [2024-10-24 11:27:29,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:29,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:27:29,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:27:29,623 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:27:29,625 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:27:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 11:27:29,919 INFO L278 TraceCheckSpWp]: Computing forward predicates...