./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.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 d0d9ba7b8de4794ff5127bd37e96765671fd57e5f618f17f55c89012f3aab4e0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:50:33,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:50:33,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:50:33,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:50:33,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:50:33,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:50:33,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:50:33,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:50:33,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:50:33,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:50:33,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:50:33,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:50:33,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:50:33,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:50:33,355 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:50:33,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:50:33,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:50:33,368 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:50:33,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:50:33,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:50:33,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:50:33,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:50:33,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:50:33,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:50:33,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:50:33,372 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:50:33,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:50:33,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:50:33,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:50:33,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:50:33,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:50:33,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:50:33,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:50:33,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:50:33,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:50:33,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:50:33,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:50:33,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:50:33,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:50:33,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:50:33,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:50:33,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:50:33,376 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 -> d0d9ba7b8de4794ff5127bd37e96765671fd57e5f618f17f55c89012f3aab4e0 [2024-11-09 01:50:33,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:50:33,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:50:33,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:50:33,632 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:50:33,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:50:33,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i [2024-11-09 01:50:35,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:50:35,213 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:50:35,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i [2024-11-09 01:50:35,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e1feab2/caa831dd698948188c566450e2a5733c/FLAG9243b7486 [2024-11-09 01:50:35,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e1feab2/caa831dd698948188c566450e2a5733c [2024-11-09 01:50:35,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:50:35,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:50:35,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:50:35,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:50:35,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:50:35,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:35,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428702d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35, skipping insertion in model container [2024-11-09 01:50:35,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:35,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:50:35,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i[916,929] [2024-11-09 01:50:35,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:50:35,868 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:50:35,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i[916,929] [2024-11-09 01:50:35,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:50:35,913 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:50:35,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35 WrapperNode [2024-11-09 01:50:35,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:50:35,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:50:35,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:50:35,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:50:35,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:35,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:35,963 INFO L138 Inliner]: procedures = 29, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 616 [2024-11-09 01:50:35,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:50:35,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:50:35,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:50:35,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:50:35,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:35,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:35,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:36,010 INFO L175 MemorySlicer]: Split 152 memory accesses to 16 slices as follows [2, 5, 8, 8, 22, 20, 12, 5, 14, 14, 3, 5, 8, 6, 3, 17]. 14 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1]. [2024-11-09 01:50:36,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:36,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:36,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:36,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:36,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:36,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:36,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:50:36,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:50:36,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:50:36,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:50:36,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35" (1/1) ... [2024-11-09 01:50:36,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:50:36,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:50:36,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:50:36,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:50:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:50:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:50:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:50:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:50:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:50:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:50:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:50:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 01:50:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 01:50:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-09 01:50:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-09 01:50:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-09 01:50:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-09 01:50:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-09 01:50:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-09 01:50:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-09 01:50:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-09 01:50:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:50:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:50:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:50:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:50:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:50:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:50:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-09 01:50:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-09 01:50:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-09 01:50:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-09 01:50:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-09 01:50:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-09 01:50:36,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-09 01:50:36,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-09 01:50:36,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-09 01:50:36,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-11-09 01:50:36,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:50:36,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:50:36,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:50:36,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:50:36,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:50:36,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:50:36,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-09 01:50:36,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-09 01:50:36,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-09 01:50:36,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-09 01:50:36,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-09 01:50:36,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-09 01:50:36,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-09 01:50:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-09 01:50:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-09 01:50:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-11-09 01:50:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:50:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:50:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:50:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:50:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:50:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:50:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 01:50:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 01:50:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-09 01:50:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-09 01:50:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-09 01:50:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-09 01:50:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-09 01:50:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-09 01:50:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-09 01:50:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-09 01:50:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:50:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:50:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:50:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:50:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:50:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:50:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-09 01:50:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-09 01:50:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-09 01:50:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-09 01:50:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-09 01:50:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-09 01:50:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-09 01:50:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-09 01:50:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-09 01:50:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-11-09 01:50:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:50:36,155 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:50:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:50:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:50:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:50:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:50:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:50:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:50:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 01:50:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 01:50:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-09 01:50:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-09 01:50:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-09 01:50:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-09 01:50:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-09 01:50:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-09 01:50:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-09 01:50:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-09 01:50:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:50:36,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:50:36,360 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:50:36,361 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:50:36,852 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2024-11-09 01:50:36,853 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:50:36,864 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:50:36,865 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:50:36,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:50:36 BoogieIcfgContainer [2024-11-09 01:50:36,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:50:36,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:50:36,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:50:36,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:50:36,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:50:35" (1/3) ... [2024-11-09 01:50:36,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778e3981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:50:36, skipping insertion in model container [2024-11-09 01:50:36,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:35" (2/3) ... [2024-11-09 01:50:36,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778e3981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:50:36, skipping insertion in model container [2024-11-09 01:50:36,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:50:36" (3/3) ... [2024-11-09 01:50:36,872 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-28.i [2024-11-09 01:50:36,884 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:50:36,885 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:50:36,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:50:36,952 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;@2d38e46b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:50:36,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:50:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 107 states have internal predecessors, (152), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:50:36,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:50:36,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:36,966 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:36,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:36,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:36,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2024573085, now seen corresponding path program 1 times [2024-11-09 01:50:36,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:50:36,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938772462] [2024-11-09 01:50:36,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:36,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:50:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:50:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:50:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:50:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:50:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:50:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:50:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:50:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:50:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:50:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:50:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:50:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:50:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:50:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:50:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:50:37,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:50:37,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938772462] [2024-11-09 01:50:37,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938772462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:50:37,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:50:37,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:50:37,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367545249] [2024-11-09 01:50:37,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:50:37,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:50:37,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:50:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:50:37,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:50:37,492 INFO L87 Difference]: Start difference. First operand has 123 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 107 states have internal predecessors, (152), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:50:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:37,520 INFO L93 Difference]: Finished difference Result 239 states and 368 transitions. [2024-11-09 01:50:37,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:50:37,522 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-11-09 01:50:37,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:37,527 INFO L225 Difference]: With dead ends: 239 [2024-11-09 01:50:37,529 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 01:50:37,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:50:37,534 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:37,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:50:37,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 01:50:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-09 01:50:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:50:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-11-09 01:50:37,577 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 130 [2024-11-09 01:50:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:37,577 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-11-09 01:50:37,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:50:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-11-09 01:50:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:50:37,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:37,580 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:37,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:50:37,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:37,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1411602097, now seen corresponding path program 1 times [2024-11-09 01:50:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:50:37,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929252145] [2024-11-09 01:50:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:50:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:50:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:50:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:50:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:50:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:50:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:50:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:50:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:50:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:50:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:50:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:50:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:50:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:50:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:50:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:50:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:50:37,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929252145] [2024-11-09 01:50:37,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929252145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:50:37,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:50:37,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:50:37,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968591881] [2024-11-09 01:50:37,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:50:37,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:50:37,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:50:37,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:50:37,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:50:37,927 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:37,977 INFO L93 Difference]: Finished difference Result 238 states and 343 transitions. [2024-11-09 01:50:37,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:50:37,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-09 01:50:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:37,979 INFO L225 Difference]: With dead ends: 238 [2024-11-09 01:50:37,979 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 01:50:37,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-11-09 01:50:37,981 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:37,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:50:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 01:50:37,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-09 01:50:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:50:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2024-11-09 01:50:37,990 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 130 [2024-11-09 01:50:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:37,992 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2024-11-09 01:50:37,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2024-11-09 01:50:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:50:37,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:37,994 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:37,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:50:37,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:37,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1108357837, now seen corresponding path program 1 times [2024-11-09 01:50:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:50:37,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341524508] [2024-11-09 01:50:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:50:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:50:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:50:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:50:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:50:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:50:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:50:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:50:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:50:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:50:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:50:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:50:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:50:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:50:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:50:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:50:38,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:50:38,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341524508] [2024-11-09 01:50:38,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341524508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:50:38,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:50:38,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:50:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361893280] [2024-11-09 01:50:38,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:50:38,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:50:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:50:38,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:50:38,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:50:38,271 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:38,305 INFO L93 Difference]: Finished difference Result 242 states and 347 transitions. [2024-11-09 01:50:38,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:50:38,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-09 01:50:38,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:38,308 INFO L225 Difference]: With dead ends: 242 [2024-11-09 01:50:38,308 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 01:50:38,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-11-09 01:50:38,310 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:38,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:50:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 01:50:38,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-09 01:50:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 107 states have internal predecessors, (147), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:50:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2024-11-09 01:50:38,320 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 130 [2024-11-09 01:50:38,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:38,321 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2024-11-09 01:50:38,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2024-11-09 01:50:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:50:38,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:38,324 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:38,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:50:38,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:38,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:38,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1106510795, now seen corresponding path program 1 times [2024-11-09 01:50:38,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:50:38,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126551030] [2024-11-09 01:50:38,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:38,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:50:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:50:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:50:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:50:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:50:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:50:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:50:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:50:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:50:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:50:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:50:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:50:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:50:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:50:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:50:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:50:38,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:50:38,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126551030] [2024-11-09 01:50:38,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126551030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:50:38,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:50:38,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:50:38,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762764077] [2024-11-09 01:50:38,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:50:38,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:50:38,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:50:38,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:50:38,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:50:38,675 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:38,785 INFO L93 Difference]: Finished difference Result 321 states and 455 transitions. [2024-11-09 01:50:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:50:38,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-09 01:50:38,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:38,788 INFO L225 Difference]: With dead ends: 321 [2024-11-09 01:50:38,788 INFO L226 Difference]: Without dead ends: 201 [2024-11-09 01:50:38,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:50:38,790 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 94 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:38,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 682 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:50:38,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-09 01:50:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2024-11-09 01:50:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 179 states have (on average 1.3854748603351956) internal successors, (248), 180 states have internal predecessors, (248), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:50:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 280 transitions. [2024-11-09 01:50:38,814 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 280 transitions. Word has length 130 [2024-11-09 01:50:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:38,815 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 280 transitions. [2024-11-09 01:50:38,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 280 transitions. [2024-11-09 01:50:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 01:50:38,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:38,817 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:38,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:50:38,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:38,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash -621672985, now seen corresponding path program 1 times [2024-11-09 01:50:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:50:38,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919858349] [2024-11-09 01:50:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:50:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:50:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:50:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:50:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:50:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:50:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:50:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:50:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:50:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:50:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:50:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:50:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:50:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:50:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:50:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:50:39,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:50:39,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919858349] [2024-11-09 01:50:39,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919858349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:50:39,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:50:39,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:50:39,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159105581] [2024-11-09 01:50:39,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:50:39,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:50:39,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:50:39,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:50:39,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:50:39,090 INFO L87 Difference]: Start difference. First operand 198 states and 280 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:39,118 INFO L93 Difference]: Finished difference Result 399 states and 565 transitions. [2024-11-09 01:50:39,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:50:39,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-09 01:50:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:39,121 INFO L225 Difference]: With dead ends: 399 [2024-11-09 01:50:39,122 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 01:50:39,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:50:39,125 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:39,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:50:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 01:50:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-09 01:50:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 185 states have (on average 1.372972972972973) internal successors, (254), 186 states have internal predecessors, (254), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:50:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 286 transitions. [2024-11-09 01:50:39,138 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 286 transitions. Word has length 132 [2024-11-09 01:50:39,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:39,138 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 286 transitions. [2024-11-09 01:50:39,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 286 transitions. [2024-11-09 01:50:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 01:50:39,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:39,140 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:39,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:50:39,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:39,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:39,141 INFO L85 PathProgramCache]: Analyzing trace with hash 611425744, now seen corresponding path program 1 times [2024-11-09 01:50:39,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:50:39,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763591164] [2024-11-09 01:50:39,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:39,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:50:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:50:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:50:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:50:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:50:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:50:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:50:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:50:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:50:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:50:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:50:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:50:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:50:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:50:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:50:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:50:39,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:50:39,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763591164] [2024-11-09 01:50:39,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763591164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:50:39,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:50:39,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:50:39,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424448191] [2024-11-09 01:50:39,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:50:39,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:50:39,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:50:39,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:50:39,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:50:39,489 INFO L87 Difference]: Start difference. First operand 204 states and 286 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:39,731 INFO L93 Difference]: Finished difference Result 737 states and 1027 transitions. [2024-11-09 01:50:39,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:50:39,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-09 01:50:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:39,736 INFO L225 Difference]: With dead ends: 737 [2024-11-09 01:50:39,737 INFO L226 Difference]: Without dead ends: 536 [2024-11-09 01:50:39,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:50:39,739 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 285 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:39,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 833 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:50:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-09 01:50:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 387. [2024-11-09 01:50:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 360 states have (on average 1.3888888888888888) internal successors, (500), 363 states have internal predecessors, (500), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:50:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 544 transitions. [2024-11-09 01:50:39,769 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 544 transitions. Word has length 132 [2024-11-09 01:50:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:39,770 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 544 transitions. [2024-11-09 01:50:39,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:39,770 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 544 transitions. [2024-11-09 01:50:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 01:50:39,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:39,773 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:39,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:50:39,773 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:39,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:39,774 INFO L85 PathProgramCache]: Analyzing trace with hash -409642610, now seen corresponding path program 1 times [2024-11-09 01:50:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:50:39,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808694844] [2024-11-09 01:50:39,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:39,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:50:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:50:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:50:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:50:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:50:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:50:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:39,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:50:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:50:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:50:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:50:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:50:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:50:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:50:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:50:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:50:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:50:40,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:50:40,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808694844] [2024-11-09 01:50:40,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808694844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:50:40,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:50:40,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:50:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739552542] [2024-11-09 01:50:40,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:50:40,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:50:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:50:40,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:50:40,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:50:40,020 INFO L87 Difference]: Start difference. First operand 387 states and 544 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:40,131 INFO L93 Difference]: Finished difference Result 801 states and 1122 transitions. [2024-11-09 01:50:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:50:40,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-09 01:50:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:40,133 INFO L225 Difference]: With dead ends: 801 [2024-11-09 01:50:40,133 INFO L226 Difference]: Without dead ends: 417 [2024-11-09 01:50:40,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:50:40,134 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 115 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:40,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 583 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:50:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-09 01:50:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2024-11-09 01:50:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 381 states have (on average 1.3779527559055118) internal successors, (525), 385 states have internal predecessors, (525), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:50:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 577 transitions. [2024-11-09 01:50:40,151 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 577 transitions. Word has length 132 [2024-11-09 01:50:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:40,152 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 577 transitions. [2024-11-09 01:50:40,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 577 transitions. [2024-11-09 01:50:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:50:40,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:40,154 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:40,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:50:40,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:40,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:40,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1343844821, now seen corresponding path program 1 times [2024-11-09 01:50:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:50:40,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298889821] [2024-11-09 01:50:40,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:50:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:50:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:50:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:50:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:50:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:50:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:50:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:50:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:50:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:50:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:50:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:50:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:50:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:50:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:50:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:50:40,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:50:40,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298889821] [2024-11-09 01:50:40,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298889821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:50:40,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:50:40,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:50:40,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137138171] [2024-11-09 01:50:40,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:50:40,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:50:40,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:50:40,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:50:40,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:50:40,721 INFO L87 Difference]: Start difference. First operand 414 states and 577 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:50:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:41,344 INFO L93 Difference]: Finished difference Result 845 states and 1181 transitions. [2024-11-09 01:50:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:50:41,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2024-11-09 01:50:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:41,346 INFO L225 Difference]: With dead ends: 845 [2024-11-09 01:50:41,346 INFO L226 Difference]: Without dead ends: 461 [2024-11-09 01:50:41,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:50:41,352 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 572 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:41,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 919 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:50:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-09 01:50:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 448. [2024-11-09 01:50:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 404 states have (on average 1.3613861386138615) internal successors, (550), 408 states have internal predecessors, (550), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:50:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 622 transitions. [2024-11-09 01:50:41,392 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 622 transitions. Word has length 134 [2024-11-09 01:50:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:41,392 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 622 transitions. [2024-11-09 01:50:41,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:50:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 622 transitions. [2024-11-09 01:50:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:50:41,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:41,394 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:41,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:50:41,394 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:41,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2133474025, now seen corresponding path program 1 times [2024-11-09 01:50:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:50:41,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271555708] [2024-11-09 01:50:41,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:41,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:50:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:41,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:50:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:41,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:50:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:41,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:50:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:41,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:50:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:42,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:50:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:42,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:50:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:42,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:50:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:42,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:50:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:42,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:50:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:42,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:50:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:42,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:50:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:42,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:50:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:42,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:50:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:42,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:50:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:50:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:50:42,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271555708] [2024-11-09 01:50:42,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271555708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:50:42,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353080508] [2024-11-09 01:50:42,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:42,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:50:42,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:50:42,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:50:42,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:50:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:42,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 01:50:42,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:50:42,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:50:42,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:50:42,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:50:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 11 proven. 129 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-09 01:50:42,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:50:42,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-09 01:50:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:50:42,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353080508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:50:42,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:50:42,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-09 01:50:42,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156029341] [2024-11-09 01:50:42,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:50:42,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 01:50:42,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:50:42,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 01:50:42,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:50:42,999 INFO L87 Difference]: Start difference. First operand 448 states and 622 transitions. Second operand has 25 states, 22 states have (on average 4.5) internal successors, (99), 25 states have internal predecessors, (99), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (29), 2 states have call predecessors, (29), 5 states have call successors, (29) [2024-11-09 01:50:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:43,817 INFO L93 Difference]: Finished difference Result 880 states and 1215 transitions. [2024-11-09 01:50:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:50:43,818 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.5) internal successors, (99), 25 states have internal predecessors, (99), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (29), 2 states have call predecessors, (29), 5 states have call successors, (29) Word has length 134 [2024-11-09 01:50:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:43,821 INFO L225 Difference]: With dead ends: 880 [2024-11-09 01:50:43,821 INFO L226 Difference]: Without dead ends: 462 [2024-11-09 01:50:43,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 282 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=282, Invalid=1358, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 01:50:43,823 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 910 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:43,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 1990 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:50:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-09 01:50:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 399. [2024-11-09 01:50:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 354 states have (on average 1.344632768361582) internal successors, (476), 357 states have internal predecessors, (476), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 01:50:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 544 transitions. [2024-11-09 01:50:43,850 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 544 transitions. Word has length 134 [2024-11-09 01:50:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:43,851 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 544 transitions. [2024-11-09 01:50:43,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.5) internal successors, (99), 25 states have internal predecessors, (99), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (29), 2 states have call predecessors, (29), 5 states have call successors, (29) [2024-11-09 01:50:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 544 transitions. [2024-11-09 01:50:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:50:43,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:43,853 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:43,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:50:44,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:50:44,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:44,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash -921570199, now seen corresponding path program 1 times [2024-11-09 01:50:44,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:50:44,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363883890] [2024-11-09 01:50:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:44,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:50:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:50:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:50:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:50:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:50:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:50:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:50:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:50:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:50:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:50:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:50:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:50:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:50:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:50:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:50:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:50:44,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:50:44,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363883890] [2024-11-09 01:50:44,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363883890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:50:44,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759927558] [2024-11-09 01:50:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:44,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:50:44,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:50:44,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:50:44,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:50:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:44,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 01:50:44,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:50:45,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:50:45,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:50:45,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:50:45,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:50:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 11 proven. 129 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-09 01:50:45,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:50:45,504 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 29 treesize of output 21 [2024-11-09 01:50:45,655 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-11-09 01:50:45,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-09 01:50:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:50:45,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759927558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:50:45,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:50:45,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 36 [2024-11-09 01:50:45,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618969186] [2024-11-09 01:50:45,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:50:45,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 01:50:45,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:50:45,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 01:50:45,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 01:50:45,862 INFO L87 Difference]: Start difference. First operand 399 states and 544 transitions. Second operand has 36 states, 33 states have (on average 4.090909090909091) internal successors, (135), 36 states have internal predecessors, (135), 6 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 3 states have call predecessors, (40), 6 states have call successors, (40) [2024-11-09 01:50:47,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:47,203 INFO L93 Difference]: Finished difference Result 901 states and 1228 transitions. [2024-11-09 01:50:47,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 01:50:47,204 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 4.090909090909091) internal successors, (135), 36 states have internal predecessors, (135), 6 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 3 states have call predecessors, (40), 6 states have call successors, (40) Word has length 134 [2024-11-09 01:50:47,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:47,208 INFO L225 Difference]: With dead ends: 901 [2024-11-09 01:50:47,208 INFO L226 Difference]: Without dead ends: 536 [2024-11-09 01:50:47,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=610, Invalid=3296, Unknown=0, NotChecked=0, Total=3906 [2024-11-09 01:50:47,210 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1255 mSDsluCounter, 2358 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:47,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 2500 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:50:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-09 01:50:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 399. [2024-11-09 01:50:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 354 states have (on average 1.344632768361582) internal successors, (476), 357 states have internal predecessors, (476), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 01:50:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 544 transitions. [2024-11-09 01:50:47,230 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 544 transitions. Word has length 134 [2024-11-09 01:50:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:47,230 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 544 transitions. [2024-11-09 01:50:47,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 4.090909090909091) internal successors, (135), 36 states have internal predecessors, (135), 6 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 3 states have call predecessors, (40), 6 states have call successors, (40) [2024-11-09 01:50:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 544 transitions. [2024-11-09 01:50:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:50:47,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:47,232 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:47,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:50:47,433 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,SelfDestructingSolverStorable9 [2024-11-09 01:50:47,434 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:47,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1942638553, now seen corresponding path program 1 times [2024-11-09 01:50:47,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:50:47,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478189469] [2024-11-09 01:50:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:47,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:50:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:50:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:50:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:50:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:50:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:50:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:50:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:50:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:50:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:50:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:50:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:50:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:50:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:50:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:50:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:50:47,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:50:47,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478189469] [2024-11-09 01:50:47,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478189469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:50:47,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857946407] [2024-11-09 01:50:47,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:47,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:50:47,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:50:48,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:50:48,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:50:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:48,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 01:50:48,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:50:48,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:50:48,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:50:48,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:50:48,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:50:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 11 proven. 129 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-09 01:50:48,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:50:48,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-09 01:50:49,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-09 01:50:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:50:49,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857946407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:50:49,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:50:49,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-09 01:50:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113440845] [2024-11-09 01:50:49,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:50:49,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 01:50:49,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:50:49,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 01:50:49,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:50:49,099 INFO L87 Difference]: Start difference. First operand 399 states and 544 transitions. Second operand has 25 states, 22 states have (on average 4.5) internal successors, (99), 25 states have internal predecessors, (99), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (29), 2 states have call predecessors, (29), 5 states have call successors, (29) [2024-11-09 01:50:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:49,894 INFO L93 Difference]: Finished difference Result 762 states and 1044 transitions. [2024-11-09 01:50:49,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:50:49,895 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.5) internal successors, (99), 25 states have internal predecessors, (99), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (29), 2 states have call predecessors, (29), 5 states have call successors, (29) Word has length 134 [2024-11-09 01:50:49,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:49,896 INFO L225 Difference]: With dead ends: 762 [2024-11-09 01:50:49,896 INFO L226 Difference]: Without dead ends: 397 [2024-11-09 01:50:49,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 282 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=1364, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 01:50:49,898 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 498 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:49,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 2657 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:50:49,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-09 01:50:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2024-11-09 01:50:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 350 states have (on average 1.3428571428571427) internal successors, (470), 353 states have internal predecessors, (470), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 01:50:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 538 transitions. [2024-11-09 01:50:49,913 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 538 transitions. Word has length 134 [2024-11-09 01:50:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:49,913 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 538 transitions. [2024-11-09 01:50:49,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.5) internal successors, (99), 25 states have internal predecessors, (99), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (29), 2 states have call predecessors, (29), 5 states have call successors, (29) [2024-11-09 01:50:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 538 transitions. [2024-11-09 01:50:49,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:50:49,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:49,915 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:49,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 01:50:50,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:50:50,116 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:50,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 260194645, now seen corresponding path program 1 times [2024-11-09 01:50:50,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:50:50,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988914276] [2024-11-09 01:50:50,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:50:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:50:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:50:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:50:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:50:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:50:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:50:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:50:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:50:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:50:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:50:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:50:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:50:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:50:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:50:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:50:50,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:50:50,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988914276] [2024-11-09 01:50:50,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988914276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:50:50,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:50:50,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:50:50,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048080214] [2024-11-09 01:50:50,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:50:50,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:50:50,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:50:50,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:50:50,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:50:50,356 INFO L87 Difference]: Start difference. First operand 395 states and 538 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:50,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:50,382 INFO L93 Difference]: Finished difference Result 756 states and 1035 transitions. [2024-11-09 01:50:50,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:50:50,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2024-11-09 01:50:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:50,384 INFO L225 Difference]: With dead ends: 756 [2024-11-09 01:50:50,384 INFO L226 Difference]: Without dead ends: 395 [2024-11-09 01:50:50,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:50:50,386 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:50,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:50:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-09 01:50:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-09 01:50:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 350 states have (on average 1.3371428571428572) internal successors, (468), 353 states have internal predecessors, (468), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 01:50:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 536 transitions. [2024-11-09 01:50:50,400 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 536 transitions. Word has length 134 [2024-11-09 01:50:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:50,400 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 536 transitions. [2024-11-09 01:50:50,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 536 transitions. [2024-11-09 01:50:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:50:50,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:50,402 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:50,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:50:50,402 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:50,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash -557453805, now seen corresponding path program 1 times [2024-11-09 01:50:50,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:50:50,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043737967] [2024-11-09 01:50:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:50,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:50:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:50:50,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:50:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:50:50,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:50:50,611 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:50:50,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:50:50,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:50:50,616 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:50,743 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:50:50,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:50:50 BoogieIcfgContainer [2024-11-09 01:50:50,745 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:50:50,745 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:50:50,745 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:50:50,745 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:50:50,746 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:50:36" (3/4) ... [2024-11-09 01:50:50,747 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:50:50,748 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:50:50,749 INFO L158 Benchmark]: Toolchain (without parser) took 15139.87ms. Allocated memory was 222.3MB in the beginning and 482.3MB in the end (delta: 260.0MB). Free memory was 193.5MB in the beginning and 319.4MB in the end (delta: -126.0MB). Peak memory consumption was 133.4MB. Max. memory is 16.1GB. [2024-11-09 01:50:50,749 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:50:50,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.33ms. Allocated memory is still 222.3MB. Free memory was 193.2MB in the beginning and 181.9MB in the end (delta: 11.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-09 01:50:50,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.06ms. Allocated memory is still 222.3MB. Free memory was 181.9MB in the beginning and 177.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:50:50,749 INFO L158 Benchmark]: Boogie Preprocessor took 92.57ms. Allocated memory is still 222.3MB. Free memory was 177.7MB in the beginning and 171.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:50:50,750 INFO L158 Benchmark]: RCFGBuilder took 807.67ms. Allocated memory is still 222.3MB. Free memory was 171.5MB in the beginning and 123.2MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-09 01:50:50,750 INFO L158 Benchmark]: TraceAbstraction took 13877.93ms. Allocated memory was 222.3MB in the beginning and 482.3MB in the end (delta: 260.0MB). Free memory was 122.2MB in the beginning and 320.5MB in the end (delta: -198.2MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2024-11-09 01:50:50,750 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 482.3MB. Free memory was 320.5MB in the beginning and 319.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:50:50,751 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.14ms. Allocated memory is still 134.2MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.33ms. Allocated memory is still 222.3MB. Free memory was 193.2MB in the beginning and 181.9MB in the end (delta: 11.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.06ms. Allocated memory is still 222.3MB. Free memory was 181.9MB in the beginning and 177.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.57ms. Allocated memory is still 222.3MB. Free memory was 177.7MB in the beginning and 171.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 807.67ms. Allocated memory is still 222.3MB. Free memory was 171.5MB in the beginning and 123.2MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13877.93ms. Allocated memory was 222.3MB in the beginning and 482.3MB in the end (delta: 260.0MB). Free memory was 122.2MB in the beginning and 320.5MB in the end (delta: -198.2MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 482.3MB. Free memory was 320.5MB in the beginning and 319.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L22] signed char var_1_1 = 1; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] float var_1_2 = 63.75; [L24] float var_1_2 = 63.75; [L25] float* var_1_2_Pointer = &(var_1_2); [L26] float var_1_3 = 255.75; [L26] float var_1_3 = 255.75; [L27] float* var_1_3_Pointer = &(var_1_3); [L28] signed char var_1_5 = 10; [L28] signed char var_1_5 = 10; [L29] signed char* var_1_5_Pointer = &(var_1_5); [L30] signed char var_1_6 = 4; [L30] signed char var_1_6 = 4; [L31] signed char* var_1_6_Pointer = &(var_1_6); [L32] signed char var_1_7 = -10; [L32] signed char var_1_7 = -10; [L33] signed char* var_1_7_Pointer = &(var_1_7); [L34] float var_1_8 = 4.75; [L34] float var_1_8 = 4.75; [L35] float* var_1_8_Pointer = &(var_1_8); [L36] float var_1_9 = 99.5; [L36] float var_1_9 = 99.5; [L37] float* var_1_9_Pointer = &(var_1_9); [L38] float var_1_10 = 255.9; [L38] float var_1_10 = 255.9; [L39] float* var_1_10_Pointer = &(var_1_10); [L40] float var_1_11 = 24.85; [L40] float var_1_11 = 24.85; [L41] float* var_1_11_Pointer = &(var_1_11); [L42] signed long int var_1_12 = -2; [L42] signed long int var_1_12 = -2; [L43] signed long int* var_1_12_Pointer = &(var_1_12); [L44] signed long int var_1_13 = 1629954775; [L44] signed long int var_1_13 = 1629954775; [L45] signed long int* var_1_13_Pointer = &(var_1_13); [L46] signed long int var_1_15 = 1928642731; [L46] signed long int var_1_15 = 1928642731; [L47] signed long int* var_1_15_Pointer = &(var_1_15); [L48] signed short int var_1_18 = 0; [L48] signed short int var_1_18 = 0; [L49] signed short int* var_1_18_Pointer = &(var_1_18); [L50] unsigned short int var_1_19 = 5; [L50] unsigned short int var_1_19 = 5; [L51] unsigned short int* var_1_19_Pointer = &(var_1_19); VAL [isInitial=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_float() [L76] EXPR \read(var_1_2) [L76] EXPR var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] EXPR var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F [L76] EXPR \read(var_1_2) [L76] EXPR var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] EXPR (var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] EXPR (var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L77] var_1_3 = __VERIFIER_nondet_float() [L78] EXPR \read(var_1_3) [L78] EXPR var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] EXPR var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F [L78] EXPR \read(var_1_3) [L78] EXPR var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] EXPR (var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] EXPR (var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L79] var_1_5 = __VERIFIER_nondet_char() [L80] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L80] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L80] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L81] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L81] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L81] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L82] var_1_6 = __VERIFIER_nondet_char() [L83] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] var_1_7 = __VERIFIER_nondet_char() [L86] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] var_1_9 = __VERIFIER_nondet_float() [L89] EXPR \read(var_1_9) [L89] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F [L89] EXPR \read(var_1_9) [L89] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] var_1_10 = __VERIFIER_nondet_float() [L91] EXPR \read(var_1_10) [L91] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F [L91] EXPR \read(var_1_10) [L91] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] var_1_13 = __VERIFIER_nondet_long() [L93] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] CALL assume_abort_if_not(var_1_13 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] RET assume_abort_if_not(var_1_13 >= 1073741822) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] var_1_15 = __VERIFIER_nondet_long() [L96] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] RET updateVariables() [L111] CALL step() [L55] signed long int stepLocal_0 = -4; [L56] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L56] COND TRUE stepLocal_0 < (*(var_1_6_Pointer)) [L57] EXPR \read(*var_1_9_Pointer) [L57] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] EXPR (((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))) [L57] EXPR \read(*var_1_9_Pointer) [L57] EXPR (((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] (*(var_1_8_Pointer)) = (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))) [L59] EXPR \read(*var_1_9_Pointer) [L59] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L59] EXPR (((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))) [L59] EXPR \read(*var_1_9_Pointer) [L59] EXPR (((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L59] (*(var_1_11_Pointer)) = (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))) [L60] EXPR \read(*var_1_5_Pointer) [L60] (*(var_1_18_Pointer)) = (*(var_1_5_Pointer)) [L61] EXPR \read(*var_1_6_Pointer) [L61] (*(var_1_19_Pointer)) = (*(var_1_6_Pointer)) [L62] EXPR \read(*var_1_2_Pointer) [L62] EXPR \read(*var_1_3_Pointer) [L62] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L62] COND FALSE !(((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) [L65] EXPR \read(*var_1_5_Pointer) [L65] (*(var_1_1_Pointer)) = (*(var_1_5_Pointer)) [L67] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] EXPR (*(var_1_6_Pointer)) | 5 VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] signed long int stepLocal_1 = (*(var_1_6_Pointer)) | 5; [L68] EXPR \read(*var_1_5_Pointer) [L68] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L68] EXPR (((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer))) [L68] EXPR \read(*var_1_5_Pointer) [L68] EXPR (((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, stepLocal_1=5, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L68] COND FALSE !(stepLocal_1 <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) [L71] EXPR \read(*var_1_6_Pointer) [L71] EXPR \read(*var_1_19_Pointer) [L71] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L71] EXPR (((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))) [L71] EXPR \read(*var_1_19_Pointer) [L71] EXPR (((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L71] EXPR \read(*var_1_19_Pointer) [L71] (*(var_1_12_Pointer)) = ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR \read(*var_1_2_Pointer) [L102] EXPR \read(*var_1_3_Pointer) [L102] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) [L102] EXPR \read(*var_1_1_Pointer) [L102] EXPR \read(*var_1_5_Pointer) [L102] EXPR \read(*var_1_6_Pointer) [L102] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))) [L102] EXPR \read(*var_1_5_Pointer) [L102] EXPR \read(*var_1_6_Pointer) [L102] EXPR ((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer))))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer))))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102-L103] return ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 13, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3731 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3731 mSDsluCounter, 12313 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10263 mSDsCounter, 262 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4556 IncrementalHoareTripleChecker+Invalid, 4818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 262 mSolverCounterUnsat, 2050 mSDtfsCounter, 4556 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1309 GetRequests, 1129 SyntacticMatches, 4 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=448occurred in iteration=8, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 372 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2122 NumberOfCodeBlocks, 2122 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2372 ConstructedInterpolants, 0 QuantifiedInterpolants, 9803 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1901 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 18 InterpolantComputations, 9 PerfectInterpolantSequences, 5967/6552 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:50:50,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.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 d0d9ba7b8de4794ff5127bd37e96765671fd57e5f618f17f55c89012f3aab4e0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:50:52,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:50:52,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:50:52,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:50:52,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:50:52,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:50:52,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:50:52,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:50:52,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:50:52,882 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:50:52,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:50:52,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:50:52,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:50:52,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:50:52,883 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:50:52,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:50:52,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:50:52,884 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:50:52,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:50:52,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:50:52,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:50:52,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:50:52,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:50:52,889 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:50:52,889 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:50:52,889 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:50:52,890 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:50:52,890 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:50:52,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:50:52,890 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:50:52,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:50:52,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:50:52,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:50:52,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:50:52,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:50:52,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:50:52,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:50:52,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:50:52,892 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:50:52,892 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:50:52,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:50:52,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:50:52,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:50:52,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:50:52,897 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 -> d0d9ba7b8de4794ff5127bd37e96765671fd57e5f618f17f55c89012f3aab4e0 [2024-11-09 01:50:53,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:50:53,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:50:53,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:50:53,194 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:50:53,195 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:50:53,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i [2024-11-09 01:50:54,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:50:54,862 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:50:54,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i [2024-11-09 01:50:54,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0dd1920/286f0b5e840747dabd930188c450cbd6/FLAGb5da7626b [2024-11-09 01:50:55,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0dd1920/286f0b5e840747dabd930188c450cbd6 [2024-11-09 01:50:55,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:50:55,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:50:55,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:50:55,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:50:55,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:50:55,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216c8cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55, skipping insertion in model container [2024-11-09 01:50:55,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:50:55,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i[916,929] [2024-11-09 01:50:55,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:50:55,488 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:50:55,499 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i[916,929] [2024-11-09 01:50:55,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:50:55,561 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:50:55,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55 WrapperNode [2024-11-09 01:50:55,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:50:55,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:50:55,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:50:55,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:50:55,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,619 INFO L138 Inliner]: procedures = 36, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 594 [2024-11-09 01:50:55,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:50:55,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:50:55,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:50:55,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:50:55,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,671 INFO L175 MemorySlicer]: Split 152 memory accesses to 16 slices as follows [2, 5, 8, 8, 22, 20, 12, 5, 14, 14, 3, 5, 8, 6, 3, 17]. 14 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1]. [2024-11-09 01:50:55,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:50:55,707 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:50:55,707 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:50:55,707 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:50:55,708 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55" (1/1) ... [2024-11-09 01:50:55,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:50:55,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:50:55,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:50:55,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:50:55,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:50:55,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:50:55,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:50:55,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:50:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:50:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:50:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:50:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-09 01:50:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-09 01:50:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-09 01:50:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-09 01:50:55,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-09 01:50:55,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-09 01:50:55,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-09 01:50:55,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-09 01:50:55,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-09 01:50:55,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-11-09 01:50:55,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:50:55,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:50:55,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:50:55,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:50:55,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:50:55,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 01:50:55,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-09 01:50:55,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-09 01:50:55,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-09 01:50:55,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-09 01:50:55,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-09 01:50:55,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-09 01:50:55,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-09 01:50:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-09 01:50:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-09 01:50:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-11-09 01:50:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:50:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:50:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:50:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:50:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:50:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:50:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-09 01:50:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-09 01:50:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-09 01:50:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-09 01:50:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-09 01:50:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-09 01:50:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-09 01:50:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-09 01:50:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-09 01:50:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-11-09 01:50:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:50:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:50:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:50:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:50:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:50:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 01:50:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-09 01:50:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-09 01:50:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-09 01:50:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-09 01:50:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-09 01:50:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-09 01:50:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-09 01:50:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-09 01:50:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-09 01:50:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2024-11-09 01:50:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:50:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:50:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:50:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:50:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:50:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-09 01:50:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-09 01:50:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-09 01:50:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-09 01:50:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-09 01:50:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-09 01:50:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-09 01:50:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-09 01:50:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-11-09 01:50:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-11-09 01:50:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-11-09 01:50:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:50:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:50:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:50:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:50:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:50:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 01:50:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-09 01:50:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-09 01:50:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-09 01:50:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-09 01:50:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-09 01:50:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-09 01:50:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-09 01:50:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-09 01:50:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-11-09 01:50:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2024-11-09 01:50:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:50:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:50:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:50:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:50:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:50:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-09 01:50:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-09 01:50:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-09 01:50:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-09 01:50:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-09 01:50:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-09 01:50:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-09 01:50:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-09 01:50:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-09 01:50:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-11-09 01:50:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-11-09 01:50:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:50:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:50:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:50:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:50:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:50:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-09 01:50:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-09 01:50:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-09 01:50:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-09 01:50:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-09 01:50:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-09 01:50:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-09 01:50:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-09 01:50:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-11-09 01:50:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-11-09 01:50:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-11-09 01:50:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:50:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:50:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:50:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:50:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:50:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-09 01:50:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-09 01:50:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-09 01:50:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-09 01:50:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-09 01:50:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-09 01:50:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-09 01:50:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-09 01:50:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-11-09 01:50:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-11-09 01:50:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-11-09 01:50:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:50:55,788 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:50:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:50:55,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:50:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:50:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:50:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:50:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:50:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:50:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:50:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-09 01:50:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-09 01:50:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-09 01:50:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-09 01:50:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-09 01:50:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-09 01:50:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-09 01:50:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-09 01:50:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-09 01:50:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-11-09 01:50:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:50:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:50:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:50:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:50:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-09 01:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-09 01:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-09 01:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-09 01:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-09 01:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-09 01:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-09 01:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-09 01:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-09 01:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-11-09 01:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-11-09 01:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:50:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:50:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:50:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:50:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:50:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-09 01:50:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-09 01:50:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-09 01:50:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-09 01:50:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-09 01:50:55,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-09 01:50:55,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-09 01:50:55,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-09 01:50:55,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-09 01:50:55,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-11-09 01:50:55,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2024-11-09 01:50:56,008 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:50:56,009 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:50:56,613 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-09 01:50:56,614 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:50:56,626 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:50:56,626 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:50:56,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:50:56 BoogieIcfgContainer [2024-11-09 01:50:56,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:50:56,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:50:56,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:50:56,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:50:56,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:50:55" (1/3) ... [2024-11-09 01:50:56,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3748adf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:50:56, skipping insertion in model container [2024-11-09 01:50:56,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:50:55" (2/3) ... [2024-11-09 01:50:56,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3748adf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:50:56, skipping insertion in model container [2024-11-09 01:50:56,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:50:56" (3/3) ... [2024-11-09 01:50:56,632 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-28.i [2024-11-09 01:50:56,644 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:50:56,645 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:50:56,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:50:56,713 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;@105014a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:50:56,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:50:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:50:56,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:50:56,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:56,726 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:56,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:56,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2114448736, now seen corresponding path program 1 times [2024-11-09 01:50:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:50:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566523037] [2024-11-09 01:50:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:56,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:50:56,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:50:56,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:50:56,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:50:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:57,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:50:57,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:50:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-09 01:50:57,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:50:57,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:50:57,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566523037] [2024-11-09 01:50:57,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566523037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:50:57,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:50:57,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:50:57,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105017758] [2024-11-09 01:50:57,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:50:57,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:50:57,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:50:57,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:50:57,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:50:57,223 INFO L87 Difference]: Start difference. First operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:50:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:57,246 INFO L93 Difference]: Finished difference Result 223 states and 344 transitions. [2024-11-09 01:50:57,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:50:57,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-11-09 01:50:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:57,256 INFO L225 Difference]: With dead ends: 223 [2024-11-09 01:50:57,257 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 01:50:57,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:50:57,262 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:57,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:50:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 01:50:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 01:50:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:50:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-11-09 01:50:57,304 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 128 [2024-11-09 01:50:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:57,304 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-11-09 01:50:57,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:50:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-11-09 01:50:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:50:57,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:57,307 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:57,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:50:57,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:50:57,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:57,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:57,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1153224588, now seen corresponding path program 1 times [2024-11-09 01:50:57,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:50:57,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650716978] [2024-11-09 01:50:57,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:57,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:50:57,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:50:57,517 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:50:57,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:50:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:57,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:50:57,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:50:58,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 01:50:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-09 01:50:58,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:50:58,629 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-09 01:50:58,629 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 20 treesize of output 19 [2024-11-09 01:50:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:50:58,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:50:58,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650716978] [2024-11-09 01:50:58,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650716978] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:50:58,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:50:58,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-09 01:50:58,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533710209] [2024-11-09 01:50:58,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:50:58,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:50:58,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:50:58,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:50:58,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:50:58,738 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 13 states, 11 states have (on average 8.363636363636363) internal successors, (92), 13 states have internal predecessors, (92), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2024-11-09 01:50:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:59,303 INFO L93 Difference]: Finished difference Result 223 states and 322 transitions. [2024-11-09 01:50:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:50:59,304 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.363636363636363) internal successors, (92), 13 states have internal predecessors, (92), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) Word has length 128 [2024-11-09 01:50:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:59,309 INFO L225 Difference]: With dead ends: 223 [2024-11-09 01:50:59,309 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 01:50:59,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:50:59,310 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 337 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:59,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 584 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:50:59,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 01:50:59,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 01:50:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:50:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-09 01:50:59,330 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 128 [2024-11-09 01:50:59,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:50:59,330 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-09 01:50:59,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.363636363636363) internal successors, (92), 13 states have internal predecessors, (92), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2024-11-09 01:50:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-09 01:50:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:50:59,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:50:59,333 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:50:59,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:50:59,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:50:59,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:50:59,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:50:59,535 INFO L85 PathProgramCache]: Analyzing trace with hash -849854343, now seen corresponding path program 1 times [2024-11-09 01:50:59,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:50:59,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525389492] [2024-11-09 01:50:59,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:50:59,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:50:59,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:50:59,542 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:50:59,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:50:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:50:59,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:50:59,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:50:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:50:59,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:50:59,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:50:59,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525389492] [2024-11-09 01:50:59,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525389492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:50:59,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:50:59,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:50:59,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781037513] [2024-11-09 01:50:59,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:50:59,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:50:59,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:50:59,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:50:59,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:50:59,940 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:50:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:50:59,989 INFO L93 Difference]: Finished difference Result 234 states and 333 transitions. [2024-11-09 01:50:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:50:59,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-09 01:50:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:50:59,993 INFO L225 Difference]: With dead ends: 234 [2024-11-09 01:50:59,993 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 01:50:59,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:50:59,994 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:50:59,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 744 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:50:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 01:51:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-09 01:51:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 104 states have internal predecessors, (141), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:51:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 169 transitions. [2024-11-09 01:51:00,024 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 169 transitions. Word has length 130 [2024-11-09 01:51:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:51:00,028 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 169 transitions. [2024-11-09 01:51:00,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:51:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2024-11-09 01:51:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:51:00,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:51:00,030 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:51:00,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:51:00,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:51:00,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:51:00,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:51:00,231 INFO L85 PathProgramCache]: Analyzing trace with hash 925153019, now seen corresponding path program 1 times [2024-11-09 01:51:00,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:51:00,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588495537] [2024-11-09 01:51:00,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:51:00,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:51:00,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:51:00,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:51:00,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 01:51:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:51:00,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:51:00,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:51:00,661 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 77 treesize of output 41 [2024-11-09 01:51:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:51:00,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:51:00,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:51:00,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588495537] [2024-11-09 01:51:00,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588495537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:51:00,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:51:00,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:51:00,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093038841] [2024-11-09 01:51:00,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:51:00,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:51:00,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:51:00,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:51:00,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:51:00,685 INFO L87 Difference]: Start difference. First operand 121 states and 169 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:51:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:51:01,113 INFO L93 Difference]: Finished difference Result 240 states and 336 transitions. [2024-11-09 01:51:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:51:01,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-09 01:51:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:51:01,119 INFO L225 Difference]: With dead ends: 240 [2024-11-09 01:51:01,119 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 01:51:01,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:51:01,120 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 155 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:51:01,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 515 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:51:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 01:51:01,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-09 01:51:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:51:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 168 transitions. [2024-11-09 01:51:01,148 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 168 transitions. Word has length 130 [2024-11-09 01:51:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:51:01,149 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 168 transitions. [2024-11-09 01:51:01,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:51:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 168 transitions. [2024-11-09 01:51:01,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 01:51:01,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:51:01,150 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:51:01,164 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-11-09 01:51:01,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:51:01,351 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:51:01,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:51:01,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1078355135, now seen corresponding path program 1 times [2024-11-09 01:51:01,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:51:01,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994708090] [2024-11-09 01:51:01,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:51:01,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:51:01,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:51:01,355 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:51:01,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 01:51:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:51:01,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:51:01,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:51:01,822 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 77 treesize of output 41 [2024-11-09 01:51:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 01:51:01,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:51:01,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:51:01,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994708090] [2024-11-09 01:51:01,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994708090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:51:01,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:51:01,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:51:01,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260910432] [2024-11-09 01:51:01,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:51:01,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:51:01,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:51:01,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:51:01,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:51:01,844 INFO L87 Difference]: Start difference. First operand 121 states and 168 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:51:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:51:02,190 INFO L93 Difference]: Finished difference Result 240 states and 334 transitions. [2024-11-09 01:51:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:51:02,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2024-11-09 01:51:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:51:02,194 INFO L225 Difference]: With dead ends: 240 [2024-11-09 01:51:02,194 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 01:51:02,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:51:02,196 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 143 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:51:02,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 509 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:51:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 01:51:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-09 01:51:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 104 states have internal predecessors, (139), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:51:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 167 transitions. [2024-11-09 01:51:02,204 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 167 transitions. Word has length 132 [2024-11-09 01:51:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:51:02,204 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 167 transitions. [2024-11-09 01:51:02,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:51:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 167 transitions. [2024-11-09 01:51:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:51:02,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:51:02,206 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:51:02,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 01:51:02,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:51:02,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:51:02,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:51:02,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2051183547, now seen corresponding path program 1 times [2024-11-09 01:51:02,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:51:02,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590206206] [2024-11-09 01:51:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:51:02,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:51:02,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:51:02,410 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:51:02,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 01:51:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:51:02,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:51:02,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:51:03,196 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 17 treesize of output 13 [2024-11-09 01:51:03,246 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 54 treesize of output 42 [2024-11-09 01:51:03,249 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 54 treesize of output 34 [2024-11-09 01:51:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 132 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-09 01:51:03,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:51:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:51:03,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:51:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590206206] [2024-11-09 01:51:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590206206] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:51:03,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:51:03,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-09 01:51:03,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143301597] [2024-11-09 01:51:03,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:51:03,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:51:03,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:51:03,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:51:03,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:51:03,360 INFO L87 Difference]: Start difference. First operand 121 states and 167 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:51:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:51:03,794 INFO L93 Difference]: Finished difference Result 311 states and 429 transitions. [2024-11-09 01:51:03,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:51:03,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2024-11-09 01:51:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:51:03,796 INFO L225 Difference]: With dead ends: 311 [2024-11-09 01:51:03,796 INFO L226 Difference]: Without dead ends: 193 [2024-11-09 01:51:03,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:51:03,797 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 84 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:51:03,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 624 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:51:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-09 01:51:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2024-11-09 01:51:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 170 states have (on average 1.3529411764705883) internal successors, (230), 171 states have internal predecessors, (230), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:51:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 262 transitions. [2024-11-09 01:51:03,806 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 262 transitions. Word has length 134 [2024-11-09 01:51:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:51:03,807 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 262 transitions. [2024-11-09 01:51:03,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:51:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 262 transitions. [2024-11-09 01:51:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:51:03,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:51:03,808 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:51:03,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 01:51:04,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:51:04,013 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:51:04,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:51:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1530438413, now seen corresponding path program 1 times [2024-11-09 01:51:04,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:51:04,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378374182] [2024-11-09 01:51:04,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:51:04,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:51:04,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:51:04,016 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:51:04,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 01:51:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:51:04,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:51:04,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:51:04,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 01:51:04,766 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-09 01:51:04,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:51:04,963 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-09 01:51:04,964 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 20 treesize of output 19 [2024-11-09 01:51:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:51:05,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:51:05,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378374182] [2024-11-09 01:51:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378374182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:51:05,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:51:05,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-09 01:51:05,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414743068] [2024-11-09 01:51:05,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:51:05,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:51:05,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:51:05,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:51:05,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:51:05,046 INFO L87 Difference]: Start difference. First operand 190 states and 262 transitions. Second operand has 13 states, 11 states have (on average 10.545454545454545) internal successors, (116), 13 states have internal predecessors, (116), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2024-11-09 01:51:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:51:05,815 INFO L93 Difference]: Finished difference Result 377 states and 521 transitions. [2024-11-09 01:51:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:51:05,816 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 10.545454545454545) internal successors, (116), 13 states have internal predecessors, (116), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) Word has length 136 [2024-11-09 01:51:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:51:05,818 INFO L225 Difference]: With dead ends: 377 [2024-11-09 01:51:05,818 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 01:51:05,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:51:05,819 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 384 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:51:05,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 687 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:51:05,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 01:51:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-09 01:51:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 170 states have (on average 1.3411764705882352) internal successors, (228), 171 states have internal predecessors, (228), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:51:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 260 transitions. [2024-11-09 01:51:05,826 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 260 transitions. Word has length 136 [2024-11-09 01:51:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:51:05,827 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 260 transitions. [2024-11-09 01:51:05,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 10.545454545454545) internal successors, (116), 13 states have internal predecessors, (116), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2024-11-09 01:51:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 260 transitions. [2024-11-09 01:51:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:51:05,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:51:05,828 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:51:05,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 01:51:06,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:51:06,033 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:51:06,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:51:06,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1531430154, now seen corresponding path program 1 times [2024-11-09 01:51:06,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:51:06,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334215738] [2024-11-09 01:51:06,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:51:06,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:51:06,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:51:06,035 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:51:06,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 01:51:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:51:06,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:51:06,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:51:06,654 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 28 treesize of output 20 [2024-11-09 01:51:06,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 14 treesize of output 10 [2024-11-09 01:51:06,715 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 27 treesize of output 15 [2024-11-09 01:51:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-09 01:51:06,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:51:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:51:06,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:51:06,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334215738] [2024-11-09 01:51:06,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334215738] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:51:06,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:51:06,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 01:51:06,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809194451] [2024-11-09 01:51:06,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:51:06,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:51:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:51:06,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:51:06,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:51:06,811 INFO L87 Difference]: Start difference. First operand 190 states and 260 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:51:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:51:06,828 INFO L93 Difference]: Finished difference Result 377 states and 517 transitions. [2024-11-09 01:51:06,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:51:06,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 136 [2024-11-09 01:51:06,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:51:06,831 INFO L225 Difference]: With dead ends: 377 [2024-11-09 01:51:06,831 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 01:51:06,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:51:06,832 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:51:06,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:51:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 01:51:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-09 01:51:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 171 states have internal predecessors, (226), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:51:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 258 transitions. [2024-11-09 01:51:06,842 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 258 transitions. Word has length 136 [2024-11-09 01:51:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:51:06,842 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 258 transitions. [2024-11-09 01:51:06,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:51:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 258 transitions. [2024-11-09 01:51:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:51:06,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:51:06,844 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:51:06,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 01:51:07,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:51:07,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:51:07,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:51:07,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1945888692, now seen corresponding path program 1 times [2024-11-09 01:51:07,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:51:07,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890600796] [2024-11-09 01:51:07,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:51:07,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:51:07,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:51:07,053 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:51:07,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 01:51:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:51:22,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 01:51:22,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:51:27,985 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 91 treesize of output 43 [2024-11-09 01:51:28,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:51:35,726 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 107 treesize of output 71 [2024-11-09 01:51:35,738 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 95 treesize of output 59 [2024-11-09 01:51:35,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 51 [2024-11-09 01:51:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 238 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 01:51:38,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:51:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:51:52,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:51:52,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890600796] [2024-11-09 01:51:52,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890600796] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:51:52,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:51:52,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [28] total 32 [2024-11-09 01:51:52,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337216404] [2024-11-09 01:51:52,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:51:52,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:51:52,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:51:52,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:51:52,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2024-11-09 01:51:52,240 INFO L87 Difference]: Start difference. First operand 190 states and 258 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:52:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:06,228 INFO L93 Difference]: Finished difference Result 373 states and 506 transitions. [2024-11-09 01:52:06,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:52:06,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 136 [2024-11-09 01:52:06,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:06,236 INFO L225 Difference]: With dead ends: 373 [2024-11-09 01:52:06,236 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 01:52:06,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 01:52:06,237 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 53 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:06,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 575 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-11-09 01:52:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 01:52:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2024-11-09 01:52:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 164 states have (on average 1.3231707317073171) internal successors, (217), 165 states have internal predecessors, (217), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:52:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 249 transitions. [2024-11-09 01:52:06,243 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 249 transitions. Word has length 136 [2024-11-09 01:52:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:06,244 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 249 transitions. [2024-11-09 01:52:06,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:52:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 249 transitions. [2024-11-09 01:52:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:52:06,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:06,245 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:06,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 01:52:06,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:06,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:06,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:06,446 INFO L85 PathProgramCache]: Analyzing trace with hash 348225118, now seen corresponding path program 1 times [2024-11-09 01:52:06,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:52:06,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894843738] [2024-11-09 01:52:06,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:06,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:06,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:52:06,449 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:52:06,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process