./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:52:49,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:52:49,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:52:49,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:52:49,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:52:49,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:52:49,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:52:49,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:52:49,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:52:49,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:52:49,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:52:49,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:52:49,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:52:49,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:52:49,963 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:52:49,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:52:49,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:52:49,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:52:49,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:52:49,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:52:49,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:52:49,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:52:49,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:52:49,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:52:49,965 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:52:49,965 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:52:49,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:52:49,965 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:52:49,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:52:49,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:52:49,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:52:49,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:52:49,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:52:49,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:52:49,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:52:49,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:52:49,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:52:49,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:52:49,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:52:49,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:52:49,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:52:49,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:52:49,967 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b [2024-11-07 10:52:50,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:52:50,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:52:50,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:52:50,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:52:50,248 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:52:50,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2024-11-07 10:52:51,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:52:51,815 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:52:51,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2024-11-07 10:52:51,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58f1762dc/4ac74cea172c4142803c907799d3aa99/FLAG228d03857 [2024-11-07 10:52:51,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58f1762dc/4ac74cea172c4142803c907799d3aa99 [2024-11-07 10:52:51,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:52:51,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:52:51,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:52:51,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:52:51,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:52:51,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:52:51" (1/1) ... [2024-11-07 10:52:51,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155ec1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:51, skipping insertion in model container [2024-11-07 10:52:51,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:52:51" (1/1) ... [2024-11-07 10:52:51,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:52:52,016 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i[917,930] [2024-11-07 10:52:52,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:52:52,101 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:52:52,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i[917,930] [2024-11-07 10:52:52,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:52:52,170 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:52:52,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52 WrapperNode [2024-11-07 10:52:52,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:52:52,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:52:52,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:52:52,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:52:52,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52" (1/1) ... [2024-11-07 10:52:52,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52" (1/1) ... [2024-11-07 10:52:52,244 INFO L138 Inliner]: procedures = 30, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 634 [2024-11-07 10:52:52,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:52:52,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:52:52,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:52:52,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:52:52,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52" (1/1) ... [2024-11-07 10:52:52,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52" (1/1) ... [2024-11-07 10:52:52,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52" (1/1) ... [2024-11-07 10:52:52,270 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:52:52,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52" (1/1) ... [2024-11-07 10:52:52,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52" (1/1) ... [2024-11-07 10:52:52,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52" (1/1) ... [2024-11-07 10:52:52,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52" (1/1) ... [2024-11-07 10:52:52,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52" (1/1) ... [2024-11-07 10:52:52,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52" (1/1) ... [2024-11-07 10:52:52,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:52:52,325 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:52:52,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:52:52,325 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:52:52,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52" (1/1) ... [2024-11-07 10:52:52,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:52:52,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:52:52,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:52:52,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:52:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:52:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:52:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:52:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:52:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:52:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:52:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:52:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:52:52,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:52:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:52:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:52:52,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:52:52,540 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:52:52,543 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:52:53,170 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2024-11-07 10:52:53,171 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:52:53,186 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:52:53,186 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:52:53,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:52:53 BoogieIcfgContainer [2024-11-07 10:52:53,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:52:53,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:52:53,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:52:53,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:52:53,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:52:51" (1/3) ... [2024-11-07 10:52:53,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5f796f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:52:53, skipping insertion in model container [2024-11-07 10:52:53,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:52" (2/3) ... [2024-11-07 10:52:53,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5f796f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:52:53, skipping insertion in model container [2024-11-07 10:52:53,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:52:53" (3/3) ... [2024-11-07 10:52:53,197 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-17.i [2024-11-07 10:52:53,210 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:52:53,210 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:52:53,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:52:53,285 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;@1aee8b0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:52:53,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:52:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:52:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:52:53,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:53,305 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:52:53,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:53,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash 37068822, now seen corresponding path program 1 times [2024-11-07 10:52:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:53,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347447433] [2024-11-07 10:52:53,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:53,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:52:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:52:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:52:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:52:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:52:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:52:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:52:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:52:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:52:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:52:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:52:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:52:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:52:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:53,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347447433] [2024-11-07 10:52:53,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347447433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:53,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:52:53,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860199922] [2024-11-07 10:52:53,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:53,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:52:53,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:53,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:52:53,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:52:53,796 INFO L87 Difference]: Start difference. First operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:52:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:53,823 INFO L93 Difference]: Finished difference Result 281 states and 438 transitions. [2024-11-07 10:52:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:52:53,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-07 10:52:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:53,832 INFO L225 Difference]: With dead ends: 281 [2024-11-07 10:52:53,832 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 10:52:53,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-07 10:52:53,837 INFO L432 NwaCegarLoop]: 207 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, 207 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-07 10:52:53,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:52:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 10:52:53,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-07 10:52:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:52:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2024-11-07 10:52:53,879 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2024-11-07 10:52:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:53,880 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2024-11-07 10:52:53,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:52:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2024-11-07 10:52:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:52:53,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:53,887 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:52:53,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:52:53,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:53,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:53,888 INFO L85 PathProgramCache]: Analyzing trace with hash 332968922, now seen corresponding path program 1 times [2024-11-07 10:52:53,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:53,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775681822] [2024-11-07 10:52:53,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:52:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:52:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:52:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:52:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:52:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:52:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:52:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:52:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:52:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:52:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:52:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:52:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:52:54,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:54,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775681822] [2024-11-07 10:52:54,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775681822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:54,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:54,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:52:54,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090137736] [2024-11-07 10:52:54,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:54,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:52:54,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:54,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:52:54,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:52:54,343 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:52:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:54,408 INFO L93 Difference]: Finished difference Result 279 states and 414 transitions. [2024-11-07 10:52:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:52:54,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-07 10:52:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:54,411 INFO L225 Difference]: With dead ends: 279 [2024-11-07 10:52:54,411 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 10:52:54,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-07 10:52:54,412 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:54,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:52:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 10:52:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-07 10:52:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:52:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-11-07 10:52:54,433 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2024-11-07 10:52:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:54,434 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-11-07 10:52:54,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:52:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-11-07 10:52:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:52:54,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:54,439 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:52:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:52:54,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:54,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1327662620, now seen corresponding path program 1 times [2024-11-07 10:52:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812275187] [2024-11-07 10:52:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:52:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:52:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:52:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:52:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:52:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:52:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:52:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:52:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:52:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:52:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:52:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:52:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:52:54,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:54,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812275187] [2024-11-07 10:52:54,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812275187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:54,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:54,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:52:54,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730119343] [2024-11-07 10:52:54,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:54,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:52:54,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:54,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:52:54,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:52:54,850 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:52:54,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:54,900 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2024-11-07 10:52:54,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:52:54,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-07 10:52:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:54,902 INFO L225 Difference]: With dead ends: 283 [2024-11-07 10:52:54,903 INFO L226 Difference]: Without dead ends: 144 [2024-11-07 10:52:54,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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-07 10:52:54,904 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:54,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:52:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-07 10:52:54,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-07 10:52:54,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:52:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-11-07 10:52:54,924 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 141 [2024-11-07 10:52:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:54,924 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-11-07 10:52:54,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:52:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-11-07 10:52:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 10:52:54,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:54,930 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:52:54,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:52:54,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:54,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1021693129, now seen corresponding path program 1 times [2024-11-07 10:52:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074077497] [2024-11-07 10:52:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:52:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:52:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:52:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:52:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:52:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:52:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:52:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:52:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:52:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:52:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:52:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:52:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:52:55,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:55,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074077497] [2024-11-07 10:52:55,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074077497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:55,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:55,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:52:55,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295821262] [2024-11-07 10:52:55,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:55,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:52:55,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:55,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:52:55,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:52:55,193 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:52:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:55,222 INFO L93 Difference]: Finished difference Result 288 states and 423 transitions. [2024-11-07 10:52:55,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:52:55,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-07 10:52:55,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:55,224 INFO L225 Difference]: With dead ends: 288 [2024-11-07 10:52:55,224 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 10:52:55,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-07 10:52:55,226 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 601 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-07 10:52:55,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 601 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:52:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 10:52:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-07 10:52:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:52:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2024-11-07 10:52:55,236 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 143 [2024-11-07 10:52:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:55,237 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2024-11-07 10:52:55,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:52:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2024-11-07 10:52:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 10:52:55,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:55,239 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:52:55,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:52:55,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:55,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:55,239 INFO L85 PathProgramCache]: Analyzing trace with hash -341634759, now seen corresponding path program 1 times [2024-11-07 10:52:55,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:55,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646704757] [2024-11-07 10:52:55,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:55,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:52:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:52:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:52:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:55,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:52:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:56,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:52:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:56,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:52:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:56,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:52:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:56,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:52:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:56,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:52:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:56,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:52:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:56,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:52:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:56,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:52:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:52:56,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:56,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646704757] [2024-11-07 10:52:56,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646704757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:56,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:56,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:52:56,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506151298] [2024-11-07 10:52:56,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:56,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:52:56,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:56,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:52:56,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:52:56,049 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:52:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:56,487 INFO L93 Difference]: Finished difference Result 351 states and 513 transitions. [2024-11-07 10:52:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:52:56,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-07 10:52:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:56,492 INFO L225 Difference]: With dead ends: 351 [2024-11-07 10:52:56,492 INFO L226 Difference]: Without dead ends: 208 [2024-11-07 10:52:56,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:52:56,493 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 402 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:56,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 626 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:52:56,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-07 10:52:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 154. [2024-11-07 10:52:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 136 states have (on average 1.4191176470588236) internal successors, (193), 136 states have internal predecessors, (193), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:52:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 225 transitions. [2024-11-07 10:52:56,516 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 225 transitions. Word has length 143 [2024-11-07 10:52:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:56,516 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 225 transitions. [2024-11-07 10:52:56,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:52:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 225 transitions. [2024-11-07 10:52:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 10:52:56,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:56,518 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:52:56,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:52:56,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:56,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2068519753, now seen corresponding path program 1 times [2024-11-07 10:52:56,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:56,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549534098] [2024-11-07 10:52:56,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:52:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:52:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:52:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:52:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:52:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:52:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:52:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:52:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:52:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:52:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:52:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:52:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:52:57,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:57,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549534098] [2024-11-07 10:52:57,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549534098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:57,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:57,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:52:57,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896840599] [2024-11-07 10:52:57,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:57,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:52:57,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:57,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:52:57,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:52:57,420 INFO L87 Difference]: Start difference. First operand 154 states and 225 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:52:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:57,826 INFO L93 Difference]: Finished difference Result 372 states and 544 transitions. [2024-11-07 10:52:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:52:57,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-07 10:52:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:57,828 INFO L225 Difference]: With dead ends: 372 [2024-11-07 10:52:57,828 INFO L226 Difference]: Without dead ends: 221 [2024-11-07 10:52:57,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:52:57,830 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 409 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:57,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 670 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:52:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-07 10:52:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 176. [2024-11-07 10:52:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 158 states have (on average 1.4177215189873418) internal successors, (224), 158 states have internal predecessors, (224), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:52:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 256 transitions. [2024-11-07 10:52:57,840 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 256 transitions. Word has length 143 [2024-11-07 10:52:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:57,841 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 256 transitions. [2024-11-07 10:52:57,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:52:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 256 transitions. [2024-11-07 10:52:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 10:52:57,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:57,843 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:52:57,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:52:57,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:57,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1388461383, now seen corresponding path program 1 times [2024-11-07 10:52:57,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:57,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462712051] [2024-11-07 10:52:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:52:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:52:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:52:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:52:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:52:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:52:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:52:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:52:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:52:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:52:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:52:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:52:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:52:58,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462712051] [2024-11-07 10:52:58,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462712051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:58,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:58,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:52:58,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614280466] [2024-11-07 10:52:58,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:58,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:52:58,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:58,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:52:58,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:52:58,831 INFO L87 Difference]: Start difference. First operand 176 states and 256 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:52:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:59,230 INFO L93 Difference]: Finished difference Result 439 states and 634 transitions. [2024-11-07 10:52:59,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:52:59,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-11-07 10:52:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:59,235 INFO L225 Difference]: With dead ends: 439 [2024-11-07 10:52:59,235 INFO L226 Difference]: Without dead ends: 266 [2024-11-07 10:52:59,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:52:59,239 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 305 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:59,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 829 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:52:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-07 10:52:59,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 204. [2024-11-07 10:52:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 186 states have (on average 1.3978494623655915) internal successors, (260), 186 states have internal predecessors, (260), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:52:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 292 transitions. [2024-11-07 10:52:59,255 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 292 transitions. Word has length 143 [2024-11-07 10:52:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:59,256 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 292 transitions. [2024-11-07 10:52:59,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:52:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 292 transitions. [2024-11-07 10:52:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 10:52:59,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:59,258 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:52:59,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:52:59,259 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:59,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:59,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1947047509, now seen corresponding path program 1 times [2024-11-07 10:52:59,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:59,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932873863] [2024-11-07 10:52:59,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:59,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:52:59,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:52:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:52:59,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:52:59,644 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:52:59,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:52:59,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:52:59,649 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:52:59,826 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:52:59,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:52:59 BoogieIcfgContainer [2024-11-07 10:52:59,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:52:59,830 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:52:59,830 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:52:59,830 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:52:59,831 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:52:53" (3/4) ... [2024-11-07 10:52:59,833 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:52:59,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:52:59,835 INFO L158 Benchmark]: Toolchain (without parser) took 7978.52ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 91.3MB in the beginning and 148.8MB in the end (delta: -57.5MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2024-11-07 10:52:59,836 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:52:59,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.63ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 74.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:52:59,836 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.56ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 70.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:52:59,836 INFO L158 Benchmark]: Boogie Preprocessor took 78.80ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 67.2MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:52:59,837 INFO L158 Benchmark]: RCFGBuilder took 861.60ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 71.2MB in the end (delta: -4.0MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-11-07 10:52:59,837 INFO L158 Benchmark]: TraceAbstraction took 6640.89ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 70.7MB in the beginning and 148.9MB in the end (delta: -78.2MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. [2024-11-07 10:52:59,837 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 234.9MB. Free memory was 148.9MB in the beginning and 148.8MB in the end (delta: 56.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:52:59,838 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.24ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.63ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 74.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.56ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 70.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 78.80ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 67.2MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 861.60ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 71.2MB in the end (delta: -4.0MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6640.89ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 70.7MB in the beginning and 148.9MB in the end (delta: -78.2MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 234.9MB. Free memory was 148.9MB in the beginning and 148.8MB in the end (delta: 56.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 140. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L59] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L60] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L61] double* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L62] double* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L63] double* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L64] signed short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L65] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L66] double* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L67] signed short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L68] signed short int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L69] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L70] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L71] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L72] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L73] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L74] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L75] unsigned char last_1_WrapperStruct00_var_1_15 = 16; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=0, last_1_WrapperStruct00_var_1_15=16] [L144] isInitial = 1 [L145] FCALL initially() [L146] COND TRUE 1 [L147] CALL updateLastVariables() [L137] EXPR WrapperStruct00.var_1_15 [L137] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L147] RET updateLastVariables() [L148] CALL updateVariables() [L108] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L111] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L112] EXPR WrapperStruct00.var_1_3 [L112] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_3 [L112] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] EXPR (WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_4 [L114] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_4 [L114] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] EXPR (WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L116] EXPR WrapperStruct00.var_1_5 [L116] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_5 [L116] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] EXPR (WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L117] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L119] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L121] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L122] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L123] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] WrapperStruct00.var_1_10 = __VERIFIER_nondet_short() [L125] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L126] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L127] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L128] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L129] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L130] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L131] EXPR WrapperStruct00.var_1_14 [L131] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L131] EXPR WrapperStruct00.var_1_14 [L131] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L132] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L133] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L134] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L148] RET updateVariables() [L149] CALL step() [L79] (*(WrapperStruct00_var_1_12_Pointer)) = last_1_WrapperStruct00_var_1_15 [L80] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L80] unsigned long int stepLocal_1 = (*(WrapperStruct00_var_1_12_Pointer)); [L81] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L81] signed short int stepLocal_0 = (*(WrapperStruct00_var_1_9_Pointer)); [L82] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_0=16383, stepLocal_1=16] [L82] COND FALSE !(stepLocal_0 >= (*(WrapperStruct00_var_1_10_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L89] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L92] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L92] COND FALSE !((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) [L95] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L95] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L100] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L100] (*(WrapperStruct00_var_1_6_Pointer)) = (*(WrapperStruct00_var_1_15_Pointer)) [L103] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L103] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L103] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L103] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) [L149] RET step() [L150] CALL, EXPR property() [L140] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) [L140] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) [L140] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L140] EXPR ((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_9_Pointer)) + last_1_WrapperStruct00_var_1_15) >= (*(WrapperStruct00_var_1_12_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140-L141] return (((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_9_Pointer)) + last_1_WrapperStruct00_var_1_15) >= (*(WrapperStruct00_var_1_12_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) ; [L150] RET, EXPR property() [L150] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1117 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1117 mSDsluCounter, 4141 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2779 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 690 IncrementalHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 1362 mSDtfsCounter, 690 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=7, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 162 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1139 NumberOfCodeBlocks, 1139 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 988 ConstructedInterpolants, 0 QuantifiedInterpolants, 2162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3360/3360 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-07 10:52:59,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:53:02,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:53:02,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:53:02,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:53:02,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:53:02,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:53:02,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:53:02,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:53:02,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:53:02,152 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:53:02,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:53:02,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:53:02,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:53:02,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:53:02,153 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:53:02,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:53:02,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:53:02,153 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:53:02,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:53:02,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:53:02,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:53:02,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:53:02,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:53:02,154 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:53:02,154 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:53:02,154 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:53:02,155 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:53:02,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:53:02,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:53:02,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:53:02,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:53:02,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:53:02,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:53:02,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:53:02,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:53:02,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:53:02,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:53:02,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:53:02,157 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:53:02,157 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:53:02,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:53:02,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:53:02,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:53:02,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:53:02,158 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b [2024-11-07 10:53:02,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:53:02,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:53:02,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:53:02,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:53:02,480 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:53:02,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2024-11-07 10:53:03,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:53:04,056 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:53:04,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2024-11-07 10:53:04,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/539cd14cf/d09508327e4a4f84b3ca0c6845548c3b/FLAG749febcf4 [2024-11-07 10:53:04,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/539cd14cf/d09508327e4a4f84b3ca0c6845548c3b [2024-11-07 10:53:04,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:53:04,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:53:04,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:53:04,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:53:04,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:53:04,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6555625c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04, skipping insertion in model container [2024-11-07 10:53:04,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:53:04,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i[917,930] [2024-11-07 10:53:04,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:53:04,357 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:53:04,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i[917,930] [2024-11-07 10:53:04,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:53:04,445 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:53:04,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04 WrapperNode [2024-11-07 10:53:04,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:53:04,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:53:04,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:53:04,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:53:04,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,525 INFO L138 Inliner]: procedures = 40, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 631 [2024-11-07 10:53:04,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:53:04,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:53:04,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:53:04,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:53:04,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,574 INFO L175 MemorySlicer]: Split 157 memory accesses to 2 slices as follows [2, 155]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 36 writes are split as follows [0, 36]. [2024-11-07 10:53:04,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:53:04,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:53:04,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:53:04,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:53:04,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:53:04,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:53:04,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:53:04,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:53:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:53:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:53:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:53:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-07 10:53:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-07 10:53:04,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:53:04,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:53:04,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:53:04,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:53:04,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:53:04,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:53:04,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:53:04,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:53:04,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:53:04,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:53:04,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:53:04,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:53:04,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:53:04,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:53:04,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:53:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:53:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-07 10:53:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-07 10:53:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:53:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:53:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:53:04,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:53:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:53:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:53:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:53:04,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:53:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:53:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:53:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:53:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:53:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:53:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:53:04,859 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:53:04,860 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:53:11,774 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-11-07 10:53:11,774 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:53:11,786 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:53:11,786 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:53:11,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:11 BoogieIcfgContainer [2024-11-07 10:53:11,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:53:11,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:53:11,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:53:11,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:53:11,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:53:04" (1/3) ... [2024-11-07 10:53:11,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73678aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:53:11, skipping insertion in model container [2024-11-07 10:53:11,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04" (2/3) ... [2024-11-07 10:53:11,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73678aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:53:11, skipping insertion in model container [2024-11-07 10:53:11,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:11" (3/3) ... [2024-11-07 10:53:11,798 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-17.i [2024-11-07 10:53:11,810 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:53:11,810 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:53:11,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:53:11,868 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;@320757f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:53:11,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:53:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:53:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:53:11,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:11,884 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:53:11,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:11,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:11,888 INFO L85 PathProgramCache]: Analyzing trace with hash 220380826, now seen corresponding path program 1 times [2024-11-07 10:53:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:53:11,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983426021] [2024-11-07 10:53:11,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:11,898 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-07 10:53:11,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:53:11,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-07 10:53:11,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:53:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:12,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:53:12,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:53:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-07 10:53:12,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:53:12,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:53:12,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983426021] [2024-11-07 10:53:12,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983426021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:12,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:12,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:53:12,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024724274] [2024-11-07 10:53:12,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:12,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:53:12,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:53:12,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:53:12,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:53:12,565 INFO L87 Difference]: Start difference. First operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:53:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:12,605 INFO L93 Difference]: Finished difference Result 281 states and 438 transitions. [2024-11-07 10:53:12,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:53:12,607 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-07 10:53:12,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:12,614 INFO L225 Difference]: With dead ends: 281 [2024-11-07 10:53:12,614 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 10:53:12,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-07 10:53:12,621 INFO L432 NwaCegarLoop]: 207 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, 207 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-07 10:53:12,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 10:53:12,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-07 10:53:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:53:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2024-11-07 10:53:12,687 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2024-11-07 10:53:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:12,688 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2024-11-07 10:53:12,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:53:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2024-11-07 10:53:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:53:12,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:12,693 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:53:12,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:53:12,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-07 10:53:12,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:12,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash 516280926, now seen corresponding path program 1 times [2024-11-07 10:53:12,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:53:12,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978256815] [2024-11-07 10:53:12,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:12,896 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-07 10:53:12,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:53:12,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-07 10:53:12,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:53:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:13,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:53:13,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:53:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-07 10:53:13,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:53:13,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:53:13,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978256815] [2024-11-07 10:53:13,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978256815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:13,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:13,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:53:13,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676191631] [2024-11-07 10:53:13,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:13,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:53:13,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:53:13,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:53:13,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:13,516 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:53:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:13,626 INFO L93 Difference]: Finished difference Result 279 states and 414 transitions. [2024-11-07 10:53:13,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:53:13,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-07 10:53:13,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:13,629 INFO L225 Difference]: With dead ends: 279 [2024-11-07 10:53:13,629 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 10:53:13,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 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-07 10:53:13,630 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:13,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:53:13,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 10:53:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-07 10:53:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:53:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-11-07 10:53:13,642 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2024-11-07 10:53:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:13,643 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-11-07 10:53:13,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:53:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-11-07 10:53:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:53:13,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:13,645 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:53:13,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 10:53:13,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-07 10:53:13,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:13,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash -430756960, now seen corresponding path program 1 times [2024-11-07 10:53:13,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:53:13,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753254903] [2024-11-07 10:53:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:13,847 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-07 10:53:13,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:53:13,849 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-07 10:53:13,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:53:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:14,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:53:14,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:53:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:53:14,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:53:14,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:53:14,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753254903] [2024-11-07 10:53:14,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753254903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:14,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:14,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:53:14,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666000014] [2024-11-07 10:53:14,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:14,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:53:14,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:53:14,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:53:14,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:14,386 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:53:14,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:14,610 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2024-11-07 10:53:14,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:53:14,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-07 10:53:14,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:14,617 INFO L225 Difference]: With dead ends: 283 [2024-11-07 10:53:14,617 INFO L226 Difference]: Without dead ends: 144 [2024-11-07 10:53:14,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 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-07 10:53:14,622 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:14,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:53:14,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-07 10:53:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-07 10:53:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:53:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-11-07 10:53:14,635 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 141 [2024-11-07 10:53:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:14,635 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-11-07 10:53:14,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:53:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-11-07 10:53:14,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 10:53:14,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:14,638 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:53:14,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 10:53:14,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-07 10:53:14,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:14,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:14,839 INFO L85 PathProgramCache]: Analyzing trace with hash 307378747, now seen corresponding path program 1 times [2024-11-07 10:53:14,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:53:14,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077858649] [2024-11-07 10:53:14,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:14,840 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-07 10:53:14,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:53:14,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-07 10:53:14,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:53:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:15,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:53:15,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:53:15,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:53:15,602 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 173 treesize of output 65 [2024-11-07 10:53:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-07 10:53:15,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:53:15,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:53:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077858649] [2024-11-07 10:53:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077858649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:15,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:15,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:53:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100900333] [2024-11-07 10:53:15,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:15,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:53:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:53:15,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:53:15,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:53:15,655 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:53:19,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:53:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:23,426 INFO L93 Difference]: Finished difference Result 286 states and 420 transitions. [2024-11-07 10:53:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:53:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-11-07 10:53:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:23,428 INFO L225 Difference]: With dead ends: 286 [2024-11-07 10:53:23,428 INFO L226 Difference]: Without dead ends: 145 [2024-11-07 10:53:23,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:53:23,430 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 175 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:23,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 504 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2024-11-07 10:53:23,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-07 10:53:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-07 10:53:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 126 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:53:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2024-11-07 10:53:23,440 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 143 [2024-11-07 10:53:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:23,441 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2024-11-07 10:53:23,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:53:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2024-11-07 10:53:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 10:53:23,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:23,443 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:53:23,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:53:23,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-07 10:53:23,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:23,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:23,644 INFO L85 PathProgramCache]: Analyzing trace with hash -161609983, now seen corresponding path program 1 times [2024-11-07 10:53:23,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:53:23,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340428672] [2024-11-07 10:53:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:23,645 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-07 10:53:23,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:53:23,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-07 10:53:23,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:53:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:24,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:53:24,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:53:24,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:53:24,471 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 173 treesize of output 65 [2024-11-07 10:53:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-07 10:53:24,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:53:24,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:53:24,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340428672] [2024-11-07 10:53:24,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340428672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:24,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:24,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:53:24,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408635764] [2024-11-07 10:53:24,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:24,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:53:24,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:53:24,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:53:24,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:53:24,519 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:53:28,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:53:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:32,176 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2024-11-07 10:53:32,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:53:32,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-07 10:53:32,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:32,179 INFO L225 Difference]: With dead ends: 286 [2024-11-07 10:53:32,179 INFO L226 Difference]: Without dead ends: 145 [2024-11-07 10:53:32,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:53:32,180 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 166 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:32,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 498 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2024-11-07 10:53:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-07 10:53:32,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-07 10:53:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:53:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-11-07 10:53:32,189 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 145 [2024-11-07 10:53:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:32,190 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-11-07 10:53:32,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:53:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-11-07 10:53:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 10:53:32,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:32,192 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:53:32,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:53:32,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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-07 10:53:32,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:32,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:32,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1042688005, now seen corresponding path program 1 times [2024-11-07 10:53:32,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:53:32,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296075723] [2024-11-07 10:53:32,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:32,394 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-07 10:53:32,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:53:32,396 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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-07 10:53:32,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:53:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:32,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:53:32,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:53:33,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:53:33,314 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 173 treesize of output 65 [2024-11-07 10:53:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-07 10:53:33,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:53:33,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:53:33,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296075723] [2024-11-07 10:53:33,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296075723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:33,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:33,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:53:33,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888950552] [2024-11-07 10:53:33,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:33,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:53:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:53:33,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:53:33,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:53:33,348 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:53:37,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:53:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:40,779 INFO L93 Difference]: Finished difference Result 286 states and 416 transitions. [2024-11-07 10:53:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:53:40,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2024-11-07 10:53:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:40,781 INFO L225 Difference]: With dead ends: 286 [2024-11-07 10:53:40,781 INFO L226 Difference]: Without dead ends: 145 [2024-11-07 10:53:40,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:53:40,782 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 138 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:40,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 494 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2024-11-07 10:53:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-07 10:53:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-07 10:53:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 126 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:53:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 208 transitions. [2024-11-07 10:53:40,795 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 208 transitions. Word has length 147 [2024-11-07 10:53:40,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:40,795 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 208 transitions. [2024-11-07 10:53:40,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:53:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 208 transitions. [2024-11-07 10:53:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:53:40,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:40,797 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:53:40,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:53:40,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/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-07 10:53:40,998 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:40,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:40,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1669517631, now seen corresponding path program 1 times [2024-11-07 10:53:40,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:53:40,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979065353] [2024-11-07 10:53:40,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:40,999 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-07 10:53:40,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:53:41,001 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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-07 10:53:41,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:53:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 10:53:41,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:53:41,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:53:41,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-07 10:53:42,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 10:53:44,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 10:53:44,188 INFO L349 Elim1Store]: treesize reduction 39, result has 27.8 percent of original size [2024-11-07 10:53:44,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2024-11-07 10:53:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:53:44,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:53:44,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:53:44,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979065353] [2024-11-07 10:53:44,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979065353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:44,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:44,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:53:44,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569526708] [2024-11-07 10:53:44,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:44,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:53:44,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:53:44,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:53:44,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:53:44,472 INFO L87 Difference]: Start difference. First operand 144 states and 208 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:53:48,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:53:52,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:54:00,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:54:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:03,269 INFO L93 Difference]: Finished difference Result 565 states and 817 transitions. [2024-11-07 10:54:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:54:03,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 149 [2024-11-07 10:54:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:03,273 INFO L225 Difference]: With dead ends: 565 [2024-11-07 10:54:03,273 INFO L226 Difference]: Without dead ends: 424 [2024-11-07 10:54:03,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:54:03,274 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 434 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 43 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:03,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 804 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 704 Invalid, 3 Unknown, 0 Unchecked, 18.6s Time] [2024-11-07 10:54:03,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-07 10:54:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 246. [2024-11-07 10:54:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 210 states have (on average 1.3714285714285714) internal successors, (288), 210 states have internal predecessors, (288), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 10:54:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 352 transitions. [2024-11-07 10:54:03,297 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 352 transitions. Word has length 149 [2024-11-07 10:54:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:03,297 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 352 transitions. [2024-11-07 10:54:03,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:54:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 352 transitions. [2024-11-07 10:54:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:54:03,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:03,300 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:54:03,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:54:03,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/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-07 10:54:03,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:03,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash -989459261, now seen corresponding path program 1 times [2024-11-07 10:54:03,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:54:03,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711013103] [2024-11-07 10:54:03,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:03,502 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-07 10:54:03,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:54:03,504 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/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-07 10:54:03,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:54:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:04,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 10:54:04,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:54:04,172 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2024-11-07 10:54:04,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2024-11-07 10:54:04,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:54:04,235 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 90 treesize of output 66 [2024-11-07 10:54:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:54:04,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:54:04,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:54:04,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711013103] [2024-11-07 10:54:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711013103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:04,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:04,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:54:04,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104377654] [2024-11-07 10:54:04,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:04,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:54:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:54:04,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:54:04,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:54:04,280 INFO L87 Difference]: Start difference. First operand 246 states and 352 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:54:08,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:12,110 INFO L93 Difference]: Finished difference Result 475 states and 682 transitions. [2024-11-07 10:54:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:54:12,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 149 [2024-11-07 10:54:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:12,114 INFO L225 Difference]: With dead ends: 475 [2024-11-07 10:54:12,114 INFO L226 Difference]: Without dead ends: 334 [2024-11-07 10:54:12,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:54:12,115 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 82 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:12,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 730 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2024-11-07 10:54:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-07 10:54:12,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 274. [2024-11-07 10:54:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 238 states have (on average 1.3697478991596639) internal successors, (326), 238 states have internal predecessors, (326), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 10:54:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 390 transitions. [2024-11-07 10:54:12,135 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 390 transitions. Word has length 149 [2024-11-07 10:54:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:12,136 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 390 transitions. [2024-11-07 10:54:12,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:54:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 390 transitions. [2024-11-07 10:54:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:54:12,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:12,139 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 10:54:12,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:54:12,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/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-07 10:54:12,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:12,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:12,340 INFO L85 PathProgramCache]: Analyzing trace with hash 57367363, now seen corresponding path program 1 times [2024-11-07 10:54:12,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:54:12,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895946668] [2024-11-07 10:54:12,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:12,341 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-07 10:54:12,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:54:12,342 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/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-07 10:54:12,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 10:54:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:13,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-07 10:54:13,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:54:13,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 10:54:14,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2024-11-07 10:54:14,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2024-11-07 10:54:14,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2024-11-07 10:54:17,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47