./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-82.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-82.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', '895e31068043c8e643e0118b1d4631b5103422d80ccaa5bb3d4d092e33709158'] 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-82.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 895e31068043c8e643e0118b1d4631b5103422d80ccaa5bb3d4d092e33709158 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:00:35,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:00:35,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:00:35,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:00:35,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:00:35,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:00:35,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:00:35,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:00:35,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:00:35,298 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:00:35,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:00:35,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:00:35,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:00:35,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:00:35,299 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:00:35,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:00:35,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:00:35,300 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:00:35,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:00:35,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:00:35,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:00:35,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:00:35,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:00:35,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:00:35,301 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:00:35,301 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:00:35,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:00:35,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:00:35,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:00:35,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:00:35,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:00:35,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:00:35,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:00:35,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:00:35,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:00:35,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:00:35,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:00:35,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:00:35,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:00:35,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:00:35,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:00:35,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:00:35,302 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 -> 895e31068043c8e643e0118b1d4631b5103422d80ccaa5bb3d4d092e33709158 [2024-11-07 11:00:35,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:00:35,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:00:35,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:00:35,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:00:35,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:00:35,630 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-82.i [2024-11-07 11:00:36,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:00:37,289 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:00:37,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-82.i [2024-11-07 11:00:37,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7ebbd238/bbf03bda7c3744bebb2f1164d82e32d5/FLAGb2ee505c1 [2024-11-07 11:00:37,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7ebbd238/bbf03bda7c3744bebb2f1164d82e32d5 [2024-11-07 11:00:37,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:00:37,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:00:37,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:00:37,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:00:37,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:00:37,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c88bd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37, skipping insertion in model container [2024-11-07 11:00:37,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:00:37,492 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-82.i[917,930] [2024-11-07 11:00:37,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:00:37,591 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:00:37,601 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-82.i[917,930] [2024-11-07 11:00:37,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:00:37,669 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:00:37,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37 WrapperNode [2024-11-07 11:00:37,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:00:37,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:00:37,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:00:37,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:00:37,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,763 INFO L138 Inliner]: procedures = 30, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2024-11-07 11:00:37,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:00:37,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:00:37,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:00:37,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:00:37,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,802 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 11:00:37,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:00:37,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:00:37,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:00:37,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:00:37,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37" (1/1) ... [2024-11-07 11:00:37,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:00:37,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:00:37,898 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 11:00:37,901 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 11:00:37,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:00:37,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 11:00:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 11:00:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 11:00:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 11:00:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 11:00:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 11:00:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 11:00:37,927 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 11:00:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 11:00:37,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:00:37,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:00:38,076 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:00:38,078 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:00:38,778 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-07 11:00:38,778 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:00:38,793 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:00:38,793 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 11:00:38,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:00:38 BoogieIcfgContainer [2024-11-07 11:00:38,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:00:38,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:00:38,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:00:38,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:00:38,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:00:37" (1/3) ... [2024-11-07 11:00:38,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3444d291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:00:38, skipping insertion in model container [2024-11-07 11:00:38,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:37" (2/3) ... [2024-11-07 11:00:38,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3444d291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:00:38, skipping insertion in model container [2024-11-07 11:00:38,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:00:38" (3/3) ... [2024-11-07 11:00:38,805 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-82.i [2024-11-07 11:00:38,819 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:00:38,819 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 11:00:38,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:00:38,889 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;@7e1fd7e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:00:38,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 11:00:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:00:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 11:00:38,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:38,904 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:38,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:38,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:38,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1098584033, now seen corresponding path program 1 times [2024-11-07 11:00:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:38,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264669814] [2024-11-07 11:00:38,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:38,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 11:00:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:00:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:00:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:00:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:00:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:00:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:00:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:00:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:00:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:00:39,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:39,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264669814] [2024-11-07 11:00:39,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264669814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:39,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:39,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 11:00:39,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341782110] [2024-11-07 11:00:39,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:39,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 11:00:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 11:00:39,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 11:00:39,578 INFO L87 Difference]: Start difference. First operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:39,610 INFO L93 Difference]: Finished difference Result 223 states and 344 transitions. [2024-11-07 11:00:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 11:00:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-07 11:00:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:39,622 INFO L225 Difference]: With dead ends: 223 [2024-11-07 11:00:39,622 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 11:00:39,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 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 11:00:39,631 INFO L432 NwaCegarLoop]: 157 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, 157 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 11:00:39,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:00:39,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 11:00:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-07 11:00:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:00:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2024-11-07 11:00:39,685 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 121 [2024-11-07 11:00:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:39,688 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2024-11-07 11:00:39,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2024-11-07 11:00:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 11:00:39,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:39,696 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:39,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:00:39,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:39,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:39,697 INFO L85 PathProgramCache]: Analyzing trace with hash -879729315, now seen corresponding path program 1 times [2024-11-07 11:00:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:39,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523946786] [2024-11-07 11:00:39,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:39,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 11:00:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:00:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:00:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:00:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:00:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:00:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:00:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:00:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:00:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:00:40,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:40,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523946786] [2024-11-07 11:00:40,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523946786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:40,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:40,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:00:40,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858514789] [2024-11-07 11:00:40,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:40,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:00:40,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:40,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:00:40,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:40,278 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:40,329 INFO L93 Difference]: Finished difference Result 221 states and 314 transitions. [2024-11-07 11:00:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:00:40,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-07 11:00:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:40,334 INFO L225 Difference]: With dead ends: 221 [2024-11-07 11:00:40,334 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 11:00:40,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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 11:00:40,335 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 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 11:00:40,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:00:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 11:00:40,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-07 11:00:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:00:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2024-11-07 11:00:40,345 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 121 [2024-11-07 11:00:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:40,346 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2024-11-07 11:00:40,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2024-11-07 11:00:40,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 11:00:40,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:40,348 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:40,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:00:40,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:40,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:40,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1839409295, now seen corresponding path program 1 times [2024-11-07 11:00:40,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:40,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694316601] [2024-11-07 11:00:40,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:40,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 11:00:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:00:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:00:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:00:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:00:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:00:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:00:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:00:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:00:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:00:40,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:40,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694316601] [2024-11-07 11:00:40,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694316601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:40,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:40,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:00:40,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288434978] [2024-11-07 11:00:40,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:40,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:00:40,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:40,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:00:40,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:00:40,711 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:40,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:40,763 INFO L93 Difference]: Finished difference Result 226 states and 319 transitions. [2024-11-07 11:00:40,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:00:40,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-07 11:00:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:40,767 INFO L225 Difference]: With dead ends: 226 [2024-11-07 11:00:40,767 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 11:00:40,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:00:40,768 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:40,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:00:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 11:00:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-07 11:00:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:00:40,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-11-07 11:00:40,786 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 123 [2024-11-07 11:00:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:40,787 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-11-07 11:00:40,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-11-07 11:00:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 11:00:40,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:40,789 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:40,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:00:40,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:40,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:40,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1357109132, now seen corresponding path program 1 times [2024-11-07 11:00:40,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:40,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484567003] [2024-11-07 11:00:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 11:00:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:00:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:00:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:00:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:00:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:00:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:00:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:00:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:00:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:00:41,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:41,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484567003] [2024-11-07 11:00:41,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484567003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:41,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:41,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:00:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911527681] [2024-11-07 11:00:41,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:41,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:00:41,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:41,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:00:41,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:41,064 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:41,109 INFO L93 Difference]: Finished difference Result 228 states and 321 transitions. [2024-11-07 11:00:41,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:00:41,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-07 11:00:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:41,113 INFO L225 Difference]: With dead ends: 228 [2024-11-07 11:00:41,115 INFO L226 Difference]: Without dead ends: 117 [2024-11-07 11:00:41,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:41,116 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 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 11:00:41,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:00:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-07 11:00:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-07 11:00:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 100 states have (on average 1.34) internal successors, (134), 100 states have internal predecessors, (134), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:00:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-11-07 11:00:41,131 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 125 [2024-11-07 11:00:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:41,132 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-11-07 11:00:41,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-11-07 11:00:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 11:00:41,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:41,133 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:41,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:00:41,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:41,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash -677050762, now seen corresponding path program 1 times [2024-11-07 11:00:41,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:41,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104019186] [2024-11-07 11:00:41,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:41,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 11:00:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:00:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:00:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:00:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:00:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:00:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:00:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:00:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:00:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:00:41,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104019186] [2024-11-07 11:00:41,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104019186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:41,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:41,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:00:41,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551564415] [2024-11-07 11:00:41,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:41,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:00:41,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:41,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:00:41,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:41,333 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:41,364 INFO L93 Difference]: Finished difference Result 232 states and 325 transitions. [2024-11-07 11:00:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:00:41,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-07 11:00:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:41,366 INFO L225 Difference]: With dead ends: 232 [2024-11-07 11:00:41,367 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 11:00:41,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:41,368 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:41,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 452 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:00:41,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 11:00:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-07 11:00:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 102 states have internal predecessors, (136), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:00:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2024-11-07 11:00:41,378 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 125 [2024-11-07 11:00:41,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:41,379 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2024-11-07 11:00:41,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2024-11-07 11:00:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 11:00:41,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:41,380 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:41,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:00:41,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:41,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:41,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1097956600, now seen corresponding path program 1 times [2024-11-07 11:00:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:41,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250699786] [2024-11-07 11:00:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 11:00:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:00:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:00:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:00:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:00:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:00:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:00:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:00:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:00:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:00:41,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:41,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250699786] [2024-11-07 11:00:41,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250699786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:41,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:41,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:00:41,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705210973] [2024-11-07 11:00:41,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:41,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:00:41,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:41,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:00:41,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:41,571 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:41,601 INFO L93 Difference]: Finished difference Result 236 states and 329 transitions. [2024-11-07 11:00:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:00:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-07 11:00:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:41,604 INFO L225 Difference]: With dead ends: 236 [2024-11-07 11:00:41,604 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 11:00:41,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:41,605 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:41,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:00:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 11:00:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-07 11:00:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 104 states have (on average 1.3269230769230769) internal successors, (138), 104 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:00:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 166 transitions. [2024-11-07 11:00:41,618 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 166 transitions. Word has length 125 [2024-11-07 11:00:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:41,619 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 166 transitions. [2024-11-07 11:00:41,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 166 transitions. [2024-11-07 11:00:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 11:00:41,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:41,624 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:41,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:00:41,625 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:41,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:41,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1099803642, now seen corresponding path program 1 times [2024-11-07 11:00:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:41,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034089140] [2024-11-07 11:00:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 11:00:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:00:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:00:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:00:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:00:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:00:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:00:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:00:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:00:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:00:42,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:42,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034089140] [2024-11-07 11:00:42,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034089140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:42,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:42,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:00:42,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551298289] [2024-11-07 11:00:42,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:42,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:00:42,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:00:42,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:00:42,308 INFO L87 Difference]: Start difference. First operand 120 states and 166 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:42,637 INFO L93 Difference]: Finished difference Result 353 states and 491 transitions. [2024-11-07 11:00:42,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:00:42,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-07 11:00:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:42,640 INFO L225 Difference]: With dead ends: 353 [2024-11-07 11:00:42,641 INFO L226 Difference]: Without dead ends: 236 [2024-11-07 11:00:42,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 11:00:42,642 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 135 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:42,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 607 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 11:00:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-07 11:00:42,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 198. [2024-11-07 11:00:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 167 states have (on average 1.3233532934131738) internal successors, (221), 167 states have internal predecessors, (221), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 11:00:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 277 transitions. [2024-11-07 11:00:42,659 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 277 transitions. Word has length 125 [2024-11-07 11:00:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:42,659 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 277 transitions. [2024-11-07 11:00:42,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 277 transitions. [2024-11-07 11:00:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 11:00:42,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:42,661 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:42,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:00:42,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:42,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:42,662 INFO L85 PathProgramCache]: Analyzing trace with hash -71441437, now seen corresponding path program 1 times [2024-11-07 11:00:42,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:42,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049386984] [2024-11-07 11:00:42,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:42,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 11:00:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:00:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:00:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:00:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:00:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:00:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:00:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:00:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:00:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:00:43,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:43,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049386984] [2024-11-07 11:00:43,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049386984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:43,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:43,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:00:43,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138981074] [2024-11-07 11:00:43,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:43,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:00:43,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:00:43,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:43,032 INFO L87 Difference]: Start difference. First operand 198 states and 277 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:43,197 INFO L93 Difference]: Finished difference Result 312 states and 436 transitions. [2024-11-07 11:00:43,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:00:43,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-07 11:00:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:43,200 INFO L225 Difference]: With dead ends: 312 [2024-11-07 11:00:43,200 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 11:00:43,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:43,201 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:43,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 396 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 11:00:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 11:00:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-07 11:00:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 157 states have (on average 1.305732484076433) internal successors, (205), 157 states have internal predecessors, (205), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 11:00:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 261 transitions. [2024-11-07 11:00:43,216 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 261 transitions. Word has length 125 [2024-11-07 11:00:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:43,217 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 261 transitions. [2024-11-07 11:00:43,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 261 transitions. [2024-11-07 11:00:43,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 11:00:43,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:43,218 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:43,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:00:43,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:43,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:43,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1854103171, now seen corresponding path program 1 times [2024-11-07 11:00:43,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:43,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391320495] [2024-11-07 11:00:43,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:43,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 11:00:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:00:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:00:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:00:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:00:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:00:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:00:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:00:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:00:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:00:43,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:43,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391320495] [2024-11-07 11:00:43,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391320495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:43,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:43,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:00:43,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751183655] [2024-11-07 11:00:43,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:43,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:00:43,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:43,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:00:43,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:00:43,452 INFO L87 Difference]: Start difference. First operand 188 states and 261 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:43,768 INFO L93 Difference]: Finished difference Result 366 states and 505 transitions. [2024-11-07 11:00:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:00:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2024-11-07 11:00:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:43,770 INFO L225 Difference]: With dead ends: 366 [2024-11-07 11:00:43,770 INFO L226 Difference]: Without dead ends: 254 [2024-11-07 11:00:43,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:00:43,771 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 70 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:43,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 690 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 11:00:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-07 11:00:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 218. [2024-11-07 11:00:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 187 states have (on average 1.3262032085561497) internal successors, (248), 187 states have internal predecessors, (248), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 11:00:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 304 transitions. [2024-11-07 11:00:43,784 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 304 transitions. Word has length 126 [2024-11-07 11:00:43,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:43,785 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 304 transitions. [2024-11-07 11:00:43,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:00:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 304 transitions. [2024-11-07 11:00:43,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 11:00:43,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:43,788 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:43,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 11:00:43,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:43,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1982266938, now seen corresponding path program 1 times [2024-11-07 11:00:43,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:43,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237222704] [2024-11-07 11:00:43,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:49,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:49,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:49,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 11:00:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:49,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:49,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:49,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:00:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:49,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:00:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:49,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:49,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:00:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:49,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:00:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:49,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:00:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:49,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:00:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:50,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:00:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:50,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:00:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:00:50,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:50,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237222704] [2024-11-07 11:00:50,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237222704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:50,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:50,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-07 11:00:50,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667080219] [2024-11-07 11:00:50,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:50,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 11:00:50,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:50,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 11:00:50,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-07 11:00:50,052 INFO L87 Difference]: Start difference. First operand 218 states and 304 transitions. Second operand has 17 states, 14 states have (on average 4.214285714285714) internal successors, (59), 17 states have internal predecessors, (59), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-07 11:00:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:53,134 INFO L93 Difference]: Finished difference Result 525 states and 725 transitions. [2024-11-07 11:00:53,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 11:00:53,134 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.214285714285714) internal successors, (59), 17 states have internal predecessors, (59), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) Word has length 126 [2024-11-07 11:00:53,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:53,137 INFO L225 Difference]: With dead ends: 525 [2024-11-07 11:00:53,137 INFO L226 Difference]: Without dead ends: 383 [2024-11-07 11:00:53,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2024-11-07 11:00:53,140 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 355 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:53,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1121 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 11:00:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-07 11:00:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 262. [2024-11-07 11:00:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 231 states have (on average 1.3333333333333333) internal successors, (308), 231 states have internal predecessors, (308), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 11:00:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 364 transitions. [2024-11-07 11:00:53,172 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 364 transitions. Word has length 126 [2024-11-07 11:00:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:53,173 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 364 transitions. [2024-11-07 11:00:53,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.214285714285714) internal successors, (59), 17 states have internal predecessors, (59), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-07 11:00:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 364 transitions. [2024-11-07 11:00:53,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 11:00:53,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:53,174 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:53,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 11:00:53,175 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:53,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash 21578577, now seen corresponding path program 1 times [2024-11-07 11:00:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:53,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479170217] [2024-11-07 11:00:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:53,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:00:53,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 11:00:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:00:53,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 11:00:53,709 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 11:00:53,710 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 11:00:53,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 11:00:53,715 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:53,863 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 11:00:53,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:00:53 BoogieIcfgContainer [2024-11-07 11:00:53,867 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 11:00:53,867 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 11:00:53,867 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 11:00:53,867 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 11:00:53,868 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:00:38" (3/4) ... [2024-11-07 11:00:53,872 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 11:00:53,872 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 11:00:53,873 INFO L158 Benchmark]: Toolchain (without parser) took 16550.90ms. Allocated memory was 100.7MB in the beginning and 377.5MB in the end (delta: 276.8MB). Free memory was 76.5MB in the beginning and 242.3MB in the end (delta: -165.8MB). Peak memory consumption was 114.7MB. Max. memory is 16.1GB. [2024-11-07 11:00:53,873 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:00:53,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.58ms. Allocated memory is still 100.7MB. Free memory was 76.3MB in the beginning and 60.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 11:00:53,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.59ms. Allocated memory is still 100.7MB. Free memory was 60.2MB in the beginning and 55.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:00:53,874 INFO L158 Benchmark]: Boogie Preprocessor took 91.67ms. Allocated memory is still 100.7MB. Free memory was 55.7MB in the beginning and 52.6MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 11:00:53,875 INFO L158 Benchmark]: RCFGBuilder took 935.46ms. Allocated memory is still 100.7MB. Free memory was 52.6MB in the beginning and 51.9MB in the end (delta: 708.2kB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-11-07 11:00:53,875 INFO L158 Benchmark]: TraceAbstraction took 15070.71ms. Allocated memory was 100.7MB in the beginning and 377.5MB in the end (delta: 276.8MB). Free memory was 51.4MB in the beginning and 242.4MB in the end (delta: -191.0MB). Peak memory consumption was 209.7MB. Max. memory is 16.1GB. [2024-11-07 11:00:53,875 INFO L158 Benchmark]: Witness Printer took 4.96ms. Allocated memory is still 377.5MB. Free memory was 242.4MB in the beginning and 242.3MB in the end (delta: 63.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 11:00:53,876 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.32ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.58ms. Allocated memory is still 100.7MB. Free memory was 76.3MB in the beginning and 60.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.59ms. Allocated memory is still 100.7MB. Free memory was 60.2MB in the beginning and 55.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 91.67ms. Allocated memory is still 100.7MB. Free memory was 55.7MB in the beginning and 52.6MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 935.46ms. Allocated memory is still 100.7MB. Free memory was 52.6MB in the beginning and 51.9MB in the end (delta: 708.2kB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15070.71ms. Allocated memory was 100.7MB in the beginning and 377.5MB in the end (delta: 276.8MB). Free memory was 51.4MB in the beginning and 242.4MB in the end (delta: -191.0MB). Peak memory consumption was 209.7MB. Max. memory is 16.1GB. * Witness Printer took 4.96ms. Allocated memory is still 377.5MB. Free memory was 242.4MB in the beginning and 242.3MB in the end (delta: 63.7kB). 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 someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 132. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L55] float* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L58] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L59] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L60] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L61] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L62] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L63] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L64] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L65] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L66] double* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L67] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L68] double* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L69] unsigned char last_1_WrapperStruct00_var_1_5 = 32; [L70] unsigned char last_1_WrapperStruct00_var_1_12 = 2; [L71] unsigned char last_1_WrapperStruct00_var_1_17 = 0; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=0, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] CALL updateLastVariables() [L127] EXPR WrapperStruct00.var_1_5 [L127] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L128] EXPR WrapperStruct00.var_1_12 [L128] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L129] EXPR WrapperStruct00.var_1_17 [L129] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L139] RET updateLastVariables() [L140] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L106] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_3 [L107] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_3 [L107] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L108] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L109] EXPR WrapperStruct00.var_1_4 [L109] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_4 [L109] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L110] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L112] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L113] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L115] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L116] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L119] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L121] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L122] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L123] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L124] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L140] RET updateVariables() [L141] CALL step() [L75] EXPR last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L75] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12; [L76] COND FALSE !((last_1_WrapperStruct00_var_1_5 / -2) >= stepLocal_0) [L79] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L79] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) [L79] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L79] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L79] (*(WrapperStruct00_var_1_5_Pointer)) = ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) [L81] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L81] COND FALSE !(! (*(WrapperStruct00_var_1_2_Pointer))) [L86] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L86] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_4_Pointer)) [L87] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L87] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_9_Pointer)) [L88] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L88] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_3_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L89] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_9_Pointer)); [L90] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32, stepLocal_1=-121] [L90] COND FALSE !(((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= stepLocal_1) [L99] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L99] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_9_Pointer)) [L141] RET step() [L142] CALL, EXPR property() [L132] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) [L132] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) [L132] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L132] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) [L132] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) [L132] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L132] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer)))) [L132] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L132] EXPR ((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) [L132] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L132] EXPR (((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((double) (*(WrapperStruct00_var_1_3_Pointer)))) [L132] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L132] EXPR ((((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((double) (*(WrapperStruct00_var_1_3_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132-L133] return ((((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((double) (*(WrapperStruct00_var_1_3_Pointer)))) ; [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 11, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 566 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 563 mSDsluCounter, 5383 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3938 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1560 IncrementalHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 1445 mSDtfsCounter, 1560 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=10, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 200 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 1370 NumberOfCodeBlocks, 1370 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1232 ConstructedInterpolants, 0 QuantifiedInterpolants, 5971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 3640/3640 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 11:00:53,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-82.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 895e31068043c8e643e0118b1d4631b5103422d80ccaa5bb3d4d092e33709158 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:00:55,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:00:56,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 11:00:56,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:00:56,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:00:56,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:00:56,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:00:56,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:00:56,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:00:56,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:00:56,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:00:56,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:00:56,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:00:56,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:00:56,130 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:00:56,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:00:56,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:00:56,131 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:00:56,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:00:56,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:00:56,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:00:56,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:00:56,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:00:56,131 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 11:00:56,131 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 11:00:56,131 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:00:56,132 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 11:00:56,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:00:56,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:00:56,132 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:00:56,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:00:56,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:00:56,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:00:56,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:00:56,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:00:56,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:00:56,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:00:56,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:00:56,134 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 11:00:56,134 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 11:00:56,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:00:56,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:00:56,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:00:56,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:00:56,134 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 -> 895e31068043c8e643e0118b1d4631b5103422d80ccaa5bb3d4d092e33709158 [2024-11-07 11:00:56,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:00:56,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:00:56,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:00:56,395 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:00:56,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:00:56,396 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-82.i [2024-11-07 11:00:57,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:00:57,959 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:00:57,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-82.i [2024-11-07 11:00:57,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/979264ad3/f215b53f244c43fe8fcdb4ac158b0a5a/FLAG767785f63 [2024-11-07 11:00:57,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/979264ad3/f215b53f244c43fe8fcdb4ac158b0a5a [2024-11-07 11:00:57,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:00:57,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:00:57,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:00:57,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:00:58,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:00:58,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:00:57" (1/1) ... [2024-11-07 11:00:58,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c867cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58, skipping insertion in model container [2024-11-07 11:00:58,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:00:57" (1/1) ... [2024-11-07 11:00:58,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:00:58,176 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-82.i[917,930] [2024-11-07 11:00:58,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:00:58,281 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:00:58,296 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-82.i[917,930] [2024-11-07 11:00:58,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:00:58,385 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:00:58,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58 WrapperNode [2024-11-07 11:00:58,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:00:58,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:00:58,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:00:58,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:00:58,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58" (1/1) ... [2024-11-07 11:00:58,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58" (1/1) ... [2024-11-07 11:00:58,462 INFO L138 Inliner]: procedures = 34, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2024-11-07 11:00:58,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:00:58,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:00:58,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:00:58,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:00:58,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58" (1/1) ... [2024-11-07 11:00:58,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58" (1/1) ... [2024-11-07 11:00:58,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58" (1/1) ... [2024-11-07 11:00:58,528 INFO L175 MemorySlicer]: Split 134 memory accesses to 2 slices as follows [2, 132]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-11-07 11:00:58,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58" (1/1) ... [2024-11-07 11:00:58,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58" (1/1) ... [2024-11-07 11:00:58,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58" (1/1) ... [2024-11-07 11:00:58,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58" (1/1) ... [2024-11-07 11:00:58,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58" (1/1) ... [2024-11-07 11:00:58,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58" (1/1) ... [2024-11-07 11:00:58,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:00:58,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:00:58,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:00:58,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:00:58,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58" (1/1) ... [2024-11-07 11:00:58,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:00:58,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:00:58,638 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 11:00:58,642 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 11:00:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:00:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 11:00:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 11:00:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-07 11:00:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-07 11:00:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 11:00:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 11:00:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 11:00:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 11:00:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 11:00:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 11:00:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 11:00:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 11:00:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 11:00:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 11:00:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 11:00:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 11:00:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 11:00:58,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 11:00:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 11:00:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 11:00:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:00:58,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:00:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 11:00:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 11:00:58,817 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:00:58,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:01:01,615 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-07 11:01:01,616 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:01:01,627 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:01:01,629 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 11:01:01,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:01:01 BoogieIcfgContainer [2024-11-07 11:01:01,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:01:01,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:01:01,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:01:01,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:01:01,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:00:57" (1/3) ... [2024-11-07 11:01:01,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe0701a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:01:01, skipping insertion in model container [2024-11-07 11:01:01,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:58" (2/3) ... [2024-11-07 11:01:01,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe0701a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:01:01, skipping insertion in model container [2024-11-07 11:01:01,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:01:01" (3/3) ... [2024-11-07 11:01:01,640 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-82.i [2024-11-07 11:01:01,654 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:01:01,654 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 11:01:01,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:01:01,732 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;@36f3c175, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:01:01,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 11:01:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:01:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 11:01:01,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:01,751 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:01,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:01,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1212278794, now seen corresponding path program 1 times [2024-11-07 11:01:01,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 11:01:01,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81086533] [2024-11-07 11:01:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:01,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 11:01:01,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 11:01:01,776 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 11:01:01,777 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 11:01:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:02,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 11:01:02,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-07 11:01:02,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 11:01:02,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 11:01:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81086533] [2024-11-07 11:01:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81086533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:02,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 11:01:02,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021967623] [2024-11-07 11:01:02,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:02,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 11:01:02,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 11:01:02,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 11:01:02,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 11:01:02,210 INFO L87 Difference]: Start difference. First operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 11:01:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:02,243 INFO L93 Difference]: Finished difference Result 209 states and 322 transitions. [2024-11-07 11:01:02,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 11:01:02,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-07 11:01:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:02,251 INFO L225 Difference]: With dead ends: 209 [2024-11-07 11:01:02,251 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 11:01:02,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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 11:01:02,256 INFO L432 NwaCegarLoop]: 146 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, 146 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 11:01:02,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 11:01:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-07 11:01:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:01:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2024-11-07 11:01:02,323 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 119 [2024-11-07 11:01:02,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:02,323 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2024-11-07 11:01:02,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 11:01:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2024-11-07 11:01:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 11:01:02,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:02,326 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:02,337 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 11:01:02,527 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 11:01:02,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:02,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:02,528 INFO L85 PathProgramCache]: Analyzing trace with hash 579592156, now seen corresponding path program 1 times [2024-11-07 11:01:02,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 11:01:02,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368447066] [2024-11-07 11:01:02,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:02,529 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 11:01:02,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 11:01:02,533 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 11:01:02,534 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 11:01:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:02,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 11:01:02,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-07 11:01:02,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 11:01:02,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 11:01:02,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368447066] [2024-11-07 11:01:02,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368447066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:02,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:02,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:01:02,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905754267] [2024-11-07 11:01:02,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:02,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:01:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 11:01:02,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:01:02,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:02,905 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 11:01:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:02,998 INFO L93 Difference]: Finished difference Result 207 states and 292 transitions. [2024-11-07 11:01:02,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:01:03,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-07 11:01:03,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:03,001 INFO L225 Difference]: With dead ends: 207 [2024-11-07 11:01:03,001 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 11:01:03,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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 11:01:03,003 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 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 11:01:03,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 11:01:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 11:01:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-07 11:01:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:01:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-11-07 11:01:03,022 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 119 [2024-11-07 11:01:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:03,024 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-11-07 11:01:03,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 11:01:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-11-07 11:01:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 11:01:03,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:03,028 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:03,037 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 11:01:03,228 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 11:01:03,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:03,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1848666466, now seen corresponding path program 1 times [2024-11-07 11:01:03,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 11:01:03,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922839244] [2024-11-07 11:01:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:03,231 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 11:01:03,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 11:01:03,235 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 11:01:03,236 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 11:01:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:03,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 11:01:03,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:01:03,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 11:01:03,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 11:01:03,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922839244] [2024-11-07 11:01:03,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922839244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:03,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:03,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:01:03,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49975042] [2024-11-07 11:01:03,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:03,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:01:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 11:01:03,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:01:03,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:03,645 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:03,713 INFO L93 Difference]: Finished difference Result 211 states and 296 transitions. [2024-11-07 11:01:03,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:01:03,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-07 11:01:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:03,718 INFO L225 Difference]: With dead ends: 211 [2024-11-07 11:01:03,718 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 11:01:03,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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 11:01:03,721 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 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 11:01:03,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 11:01:03,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-07 11:01:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:01:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2024-11-07 11:01:03,736 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 150 transitions. Word has length 119 [2024-11-07 11:01:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:03,737 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 150 transitions. [2024-11-07 11:01:03,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2024-11-07 11:01:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 11:01:03,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:03,741 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:03,751 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 11:01:03,942 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 11:01:03,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:03,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:03,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1837726192, now seen corresponding path program 1 times [2024-11-07 11:01:03,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 11:01:03,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272046043] [2024-11-07 11:01:03,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:03,943 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 11:01:03,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 11:01:03,947 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 11:01:03,949 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 11:01:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:04,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 11:01:04,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:01:04,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 11:01:04,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 11:01:04,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272046043] [2024-11-07 11:01:04,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272046043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:04,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:04,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:01:04,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071898889] [2024-11-07 11:01:04,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:04,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:01:04,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 11:01:04,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:01:04,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:01:04,284 INFO L87 Difference]: Start difference. First operand 108 states and 150 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:04,336 INFO L93 Difference]: Finished difference Result 216 states and 301 transitions. [2024-11-07 11:01:04,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:01:04,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-07 11:01:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:04,339 INFO L225 Difference]: With dead ends: 216 [2024-11-07 11:01:04,339 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 11:01:04,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:01:04,342 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:04,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 11:01:04,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-11-07 11:01:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:01:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 151 transitions. [2024-11-07 11:01:04,356 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 151 transitions. Word has length 121 [2024-11-07 11:01:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:04,356 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 151 transitions. [2024-11-07 11:01:04,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 151 transitions. [2024-11-07 11:01:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 11:01:04,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:04,361 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:04,371 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-07 11:01:04,561 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 11:01:04,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:04,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1128935945, now seen corresponding path program 1 times [2024-11-07 11:01:04,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 11:01:04,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817524841] [2024-11-07 11:01:04,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:04,563 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 11:01:04,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 11:01:04,565 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 11:01:04,566 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 11:01:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:04,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 11:01:04,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:01:04,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 11:01:04,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 11:01:04,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817524841] [2024-11-07 11:01:04,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817524841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:04,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:04,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:01:04,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841118421] [2024-11-07 11:01:04,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:04,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:01:04,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 11:01:04,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:01:04,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:04,933 INFO L87 Difference]: Start difference. First operand 109 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:07,657 INFO L93 Difference]: Finished difference Result 210 states and 292 transitions. [2024-11-07 11:01:07,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:01:07,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-07 11:01:07,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:07,659 INFO L225 Difference]: With dead ends: 210 [2024-11-07 11:01:07,659 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 11:01:07,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 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 11:01:07,660 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:07,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 11:01:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 11:01:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-07 11:01:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:01:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2024-11-07 11:01:07,668 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 123 [2024-11-07 11:01:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:07,670 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2024-11-07 11:01:07,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2024-11-07 11:01:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 11:01:07,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:07,672 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:07,684 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 11:01:07,872 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 11:01:07,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:07,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:07,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1771764727, now seen corresponding path program 1 times [2024-11-07 11:01:07,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 11:01:07,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22354465] [2024-11-07 11:01:07,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:07,874 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 11:01:07,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 11:01:07,876 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 11:01:07,877 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 11:01:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:08,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 11:01:08,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:01:08,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 11:01:08,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 11:01:08,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22354465] [2024-11-07 11:01:08,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22354465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:08,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:08,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:01:08,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546441379] [2024-11-07 11:01:08,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:08,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:01:08,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 11:01:08,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:01:08,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:08,167 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:08,246 INFO L93 Difference]: Finished difference Result 208 states and 287 transitions. [2024-11-07 11:01:08,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:01:08,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-07 11:01:08,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:08,249 INFO L225 Difference]: With dead ends: 208 [2024-11-07 11:01:08,250 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 11:01:08,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 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 11:01:08,251 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:08,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 11:01:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 11:01:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-07 11:01:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:01:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2024-11-07 11:01:08,262 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 123 [2024-11-07 11:01:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:08,263 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2024-11-07 11:01:08,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2024-11-07 11:01:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 11:01:08,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:08,265 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:08,273 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 11:01:08,472 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 11:01:08,472 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:08,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1843144199, now seen corresponding path program 1 times [2024-11-07 11:01:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 11:01:08,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318101084] [2024-11-07 11:01:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:08,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 11:01:08,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 11:01:08,478 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 11:01:08,479 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 11:01:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:08,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 11:01:08,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:01:08,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 11:01:08,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 11:01:08,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318101084] [2024-11-07 11:01:08,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318101084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:08,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:08,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:01:08,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270595174] [2024-11-07 11:01:08,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:08,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:01:08,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 11:01:08,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:01:08,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:01:08,827 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:08,940 INFO L93 Difference]: Finished difference Result 212 states and 291 transitions. [2024-11-07 11:01:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:01:08,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-07 11:01:08,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:08,943 INFO L225 Difference]: With dead ends: 212 [2024-11-07 11:01:08,943 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 11:01:08,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:01:08,944 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:08,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 529 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 11:01:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 11:01:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-07 11:01:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:01:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2024-11-07 11:01:08,958 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 123 [2024-11-07 11:01:08,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:08,958 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2024-11-07 11:01:08,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2024-11-07 11:01:08,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 11:01:08,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:08,959 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:08,969 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 11:01:09,160 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 11:01:09,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:09,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash -68136837, now seen corresponding path program 1 times [2024-11-07 11:01:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 11:01:09,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360111012] [2024-11-07 11:01:09,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:09,161 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 11:01:09,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 11:01:09,163 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 11:01:09,164 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 11:01:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:09,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 11:01:09,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:01:09,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 11:01:09,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 11:01:09,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360111012] [2024-11-07 11:01:09,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360111012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:09,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:09,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:01:09,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393868287] [2024-11-07 11:01:09,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:09,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:01:09,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 11:01:09,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:01:09,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:01:09,448 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:09,586 INFO L93 Difference]: Finished difference Result 216 states and 295 transitions. [2024-11-07 11:01:09,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:01:09,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-07 11:01:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:09,588 INFO L225 Difference]: With dead ends: 216 [2024-11-07 11:01:09,590 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 11:01:09,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:01:09,592 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:09,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 655 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 11:01:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 11:01:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-07 11:01:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 94 states have internal predecessors, (121), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 11:01:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 149 transitions. [2024-11-07 11:01:09,598 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 149 transitions. Word has length 123 [2024-11-07 11:01:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:09,599 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 149 transitions. [2024-11-07 11:01:09,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2024-11-07 11:01:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 11:01:09,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:09,600 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:09,613 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 11:01:09,801 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 11:01:09,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:09,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:09,802 INFO L85 PathProgramCache]: Analyzing trace with hash -66289795, now seen corresponding path program 1 times [2024-11-07 11:01:09,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 11:01:09,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163017450] [2024-11-07 11:01:09,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:09,803 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 11:01:09,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 11:01:09,805 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 11:01:09,806 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 11:01:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:10,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 11:01:10,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:10,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:10,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:10,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:10,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 41 [2024-11-07 11:01:10,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 11:01:10,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 21 [2024-11-07 11:01:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 11:01:10,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 11:01:10,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 11:01:10,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163017450] [2024-11-07 11:01:10,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163017450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:10,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:10,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:01:10,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118099724] [2024-11-07 11:01:10,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:10,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:01:10,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 11:01:10,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:01:10,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:01:10,696 INFO L87 Difference]: Start difference. First operand 110 states and 149 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:13,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:13,972 INFO L93 Difference]: Finished difference Result 325 states and 441 transitions. [2024-11-07 11:01:13,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:01:13,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-07 11:01:13,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:13,974 INFO L225 Difference]: With dead ends: 325 [2024-11-07 11:01:13,974 INFO L226 Difference]: Without dead ends: 218 [2024-11-07 11:01:13,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:01:13,975 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 104 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:13,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 415 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-07 11:01:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-07 11:01:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 184. [2024-11-07 11:01:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 152 states have (on average 1.2763157894736843) internal successors, (194), 152 states have internal predecessors, (194), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 11:01:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 250 transitions. [2024-11-07 11:01:13,991 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 250 transitions. Word has length 123 [2024-11-07 11:01:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:13,991 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 250 transitions. [2024-11-07 11:01:13,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 11:01:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 250 transitions. [2024-11-07 11:01:13,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 11:01:13,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:13,993 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:14,005 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-07 11:01:14,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 11:01:14,194 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:14,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:14,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1109371107, now seen corresponding path program 1 times [2024-11-07 11:01:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 11:01:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114681841] [2024-11-07 11:01:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:14,195 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 11:01:14,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 11:01:14,197 INFO L229 MonitoredProcess]: Starting monitored process 11 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 11:01:14,198 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 (11)] Waiting until timeout for monitored process [2024-11-07 11:01:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:14,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-07 11:01:14,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:19,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 11:01:19,850 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 11:01:20,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-07 11:01:21,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 11:01:23,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2024-11-07 11:01:23,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 72 [2024-11-07 11:01:24,116 INFO L349 Elim1Store]: treesize reduction 353, result has 5.6 percent of original size [2024-11-07 11:01:24,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 36 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 193 treesize of output 350 [2024-11-07 11:01:26,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2024-11-07 11:01:26,601 INFO L349 Elim1Store]: treesize reduction 190, result has 7.8 percent of original size [2024-11-07 11:01:26,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 102 [2024-11-07 11:01:26,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 75 [2024-11-07 11:01:27,312 INFO L349 Elim1Store]: treesize reduction 144, result has 17.7 percent of original size [2024-11-07 11:01:27,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 321 treesize of output 249