./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.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-7.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', 'c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53'] 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-7.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 c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:58:56,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:58:56,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:58:56,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:58:56,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:58:56,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:58:56,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:58:56,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:58:56,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:58:56,524 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:58:56,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:58:56,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:58:56,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:58:56,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:58:56,525 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:58:56,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:58:56,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:58:56,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:58:56,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:58:56,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:58:56,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:58:56,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:58:56,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:58:56,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:58:56,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:58:56,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:58:56,528 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 -> c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 [2024-11-07 10:58:56,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:58:56,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:58:56,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:58:56,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:58:56,751 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:58:56,751 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-7.i [2024-11-07 10:58:57,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:58:58,063 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:58:58,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.i [2024-11-07 10:58:58,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a080f91c/3062331219e64362befa28a661ea3e51/FLAGfb92e21de [2024-11-07 10:58:58,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a080f91c/3062331219e64362befa28a661ea3e51 [2024-11-07 10:58:58,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:58:58,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:58:58,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:58:58,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:58:58,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:58:58,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd15191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58, skipping insertion in model container [2024-11-07 10:58:58,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:58:58,188 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-7.i[916,929] [2024-11-07 10:58:58,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:58:58,242 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:58:58,249 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-7.i[916,929] [2024-11-07 10:58:58,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:58:58,295 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:58:58,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58 WrapperNode [2024-11-07 10:58:58,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:58:58,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:58:58,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:58:58,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:58:58,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,340 INFO L138 Inliner]: procedures = 30, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 486 [2024-11-07 10:58:58,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:58:58,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:58:58,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:58:58,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:58:58,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,369 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:58:58,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:58:58,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:58:58,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:58:58,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:58:58,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58" (1/1) ... [2024-11-07 10:58:58,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:58:58,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:58:58,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:58:58,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:58:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:58:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:58:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:58:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:58:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:58:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:58:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:58:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:58:58,450 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:58:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:58:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:58:58,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:58:58,562 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:58:58,563 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:58:58,940 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-07 10:58:58,940 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:58:58,950 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:58:58,950 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:58:58,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:58:58 BoogieIcfgContainer [2024-11-07 10:58:58,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:58:58,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:58:58,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:58:58,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:58:58,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:58:58" (1/3) ... [2024-11-07 10:58:58,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e4eb1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:58:58, skipping insertion in model container [2024-11-07 10:58:58,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:58" (2/3) ... [2024-11-07 10:58:58,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e4eb1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:58:58, skipping insertion in model container [2024-11-07 10:58:58,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:58:58" (3/3) ... [2024-11-07 10:58:58,958 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-7.i [2024-11-07 10:58:58,968 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:58:58,969 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:58:59,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:58:59,010 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;@32e9b503, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:58:59,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:58:59,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 86 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:58:59,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:59,019 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:58:59,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:59,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:59,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1314253659, now seen corresponding path program 1 times [2024-11-07 10:58:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:58:59,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681742236] [2024-11-07 10:58:59,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:58:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:58:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:58:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:58:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:58:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:58:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:58:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:58:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:58:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:58:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:58:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:58:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:58:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:58:59,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:58:59,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681742236] [2024-11-07 10:58:59,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681742236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:59,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:59,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:58:59,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22976766] [2024-11-07 10:58:59,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:59,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:58:59,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:58:59,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:58:59,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:58:59,346 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 86 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:59,369 INFO L93 Difference]: Finished difference Result 193 states and 304 transitions. [2024-11-07 10:58:59,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:58:59,371 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-07 10:58:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:59,376 INFO L225 Difference]: With dead ends: 193 [2024-11-07 10:58:59,376 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 10:58:59,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:58:59,380 INFO L432 NwaCegarLoop]: 138 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, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:59,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:58:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 10:58:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-07 10:58:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:59,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-07 10:58:59,412 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 103 [2024-11-07 10:58:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:59,413 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-07 10:58:59,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-07 10:58:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:58:59,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:59,416 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:58:59,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:58:59,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:59,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:59,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2051699531, now seen corresponding path program 1 times [2024-11-07 10:58:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:58:59,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930870615] [2024-11-07 10:58:59,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:59,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:58:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:58:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:58:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:58:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:58:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:58:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:58:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:58:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:58:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:58:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:58:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:58:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:58:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:58:59,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:58:59,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930870615] [2024-11-07 10:58:59,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930870615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:59,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:59,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:58:59,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966017931] [2024-11-07 10:58:59,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:59,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:58:59,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:58:59,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:58:59,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:58:59,623 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:59,648 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2024-11-07 10:58:59,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:58:59,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-07 10:58:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:59,651 INFO L225 Difference]: With dead ends: 190 [2024-11-07 10:58:59,651 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 10:58:59,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:58:59,653 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:59,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:58:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 10:58:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-07 10:58:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-07 10:58:59,663 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 103 [2024-11-07 10:58:59,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:59,664 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-07 10:58:59,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-07 10:58:59,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:58:59,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:59,666 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:58:59,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:58:59,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:59,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:59,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1040582281, now seen corresponding path program 1 times [2024-11-07 10:58:59,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:58:59,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449462820] [2024-11-07 10:58:59,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:58:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:01,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:59:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:59:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:01,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:59:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:01,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:59:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:01,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:59:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:01,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:59:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:59:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:01,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:59:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:01,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:59:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:59:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:01,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:59:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:01,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:59:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:59:01,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:59:01,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449462820] [2024-11-07 10:59:01,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449462820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:59:01,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:59:01,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:59:01,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604983110] [2024-11-07 10:59:01,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:59:01,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:59:01,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:59:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:59:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:59:01,868 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:59:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:59:02,488 INFO L93 Difference]: Finished difference Result 195 states and 280 transitions. [2024-11-07 10:59:02,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:59:02,490 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-11-07 10:59:02,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:59:02,491 INFO L225 Difference]: With dead ends: 195 [2024-11-07 10:59:02,491 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 10:59:02,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:59:02,492 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 168 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:59:02,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 425 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:59:02,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 10:59:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-11-07 10:59:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:59:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-07 10:59:02,506 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 103 [2024-11-07 10:59:02,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:59:02,508 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-07 10:59:02,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:59:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-07 10:59:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:59:02,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:59:02,509 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:59:02,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:59:02,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:59:02,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:59:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash -131377918, now seen corresponding path program 1 times [2024-11-07 10:59:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:59:02,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182039928] [2024-11-07 10:59:02,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:02,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:59:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:03,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:59:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:03,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:59:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:59:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:03,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:59:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:03,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:59:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:03,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:59:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:59:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:59:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:59:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:59:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:59:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:59:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:59:04,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:59:04,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182039928] [2024-11-07 10:59:04,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182039928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:59:04,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:59:04,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:59:04,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518551946] [2024-11-07 10:59:04,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:59:04,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:59:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:59:04,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:59:04,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:59:04,039 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:59:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:59:04,619 INFO L93 Difference]: Finished difference Result 197 states and 281 transitions. [2024-11-07 10:59:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:59:04,620 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2024-11-07 10:59:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:59:04,621 INFO L225 Difference]: With dead ends: 197 [2024-11-07 10:59:04,621 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 10:59:04,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:59:04,622 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 219 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:59:04,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 395 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:59:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 10:59:04,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-07 10:59:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:59:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2024-11-07 10:59:04,638 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 105 [2024-11-07 10:59:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:59:04,639 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2024-11-07 10:59:04,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:59:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2024-11-07 10:59:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 10:59:04,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:59:04,641 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:59:04,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:59:04,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:59:04,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:59:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash 901598911, now seen corresponding path program 1 times [2024-11-07 10:59:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:59:04,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608480837] [2024-11-07 10:59:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:59:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:59:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:59:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:59:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:59:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:59:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:59:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:59:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:59:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:59:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:59:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:59:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:59:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:59:04,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:59:04,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608480837] [2024-11-07 10:59:04,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608480837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:59:04,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:59:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:59:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835619021] [2024-11-07 10:59:04,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:59:04,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:59:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:59:04,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:59:04,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:59:04,703 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:59:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:59:04,717 INFO L93 Difference]: Finished difference Result 192 states and 275 transitions. [2024-11-07 10:59:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:59:04,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-07 10:59:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:59:04,718 INFO L225 Difference]: With dead ends: 192 [2024-11-07 10:59:04,718 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 10:59:04,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:59:04,719 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:59:04,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:59:04,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 10:59:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-07 10:59:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:59:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2024-11-07 10:59:04,726 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 106 [2024-11-07 10:59:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:59:04,727 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2024-11-07 10:59:04,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:59:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2024-11-07 10:59:04,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 10:59:04,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:59:04,728 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:59:04,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:59:04,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:59:04,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:59:04,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1581657281, now seen corresponding path program 1 times [2024-11-07 10:59:04,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:59:04,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476018502] [2024-11-07 10:59:04,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:04,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:59:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:59:04,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1669793357] [2024-11-07 10:59:04,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:04,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:59:04,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:59:04,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:59:04,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 10:59:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:59:05,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:59:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:59:05,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:59:05,641 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:59:05,642 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:59:05,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:59:05,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:59:05,846 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 10:59:05,930 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:59:05,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:59:05 BoogieIcfgContainer [2024-11-07 10:59:05,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:59:05,935 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:59:05,937 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:59:05,937 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:59:05,938 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:58:58" (3/4) ... [2024-11-07 10:59:05,939 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:59:05,940 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:59:05,940 INFO L158 Benchmark]: Toolchain (without parser) took 7858.17ms. Allocated memory was 100.7MB in the beginning and 268.4MB in the end (delta: 167.8MB). Free memory was 77.0MB in the beginning and 93.8MB in the end (delta: -16.8MB). Peak memory consumption was 151.4MB. Max. memory is 16.1GB. [2024-11-07 10:59:05,941 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:59:05,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.21ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 61.9MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:59:05,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.76ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 58.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:59:05,942 INFO L158 Benchmark]: Boogie Preprocessor took 54.18ms. Allocated memory is still 100.7MB. Free memory was 58.3MB in the beginning and 55.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:59:05,942 INFO L158 Benchmark]: RCFGBuilder took 552.05ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 60.6MB in the end (delta: -5.2MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-07 10:59:05,943 INFO L158 Benchmark]: TraceAbstraction took 6982.66ms. Allocated memory was 100.7MB in the beginning and 268.4MB in the end (delta: 167.8MB). Free memory was 59.8MB in the beginning and 93.9MB in the end (delta: -34.1MB). Peak memory consumption was 137.9MB. Max. memory is 16.1GB. [2024-11-07 10:59:05,944 INFO L158 Benchmark]: Witness Printer took 4.83ms. Allocated memory is still 268.4MB. Free memory was 93.9MB in the beginning and 93.8MB in the end (delta: 67.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:59:05,945 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.16ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.21ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 61.9MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.76ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 58.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.18ms. Allocated memory is still 100.7MB. Free memory was 58.3MB in the beginning and 55.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 552.05ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 60.6MB in the end (delta: -5.2MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6982.66ms. Allocated memory was 100.7MB in the beginning and 268.4MB in the end (delta: 167.8MB). Free memory was 59.8MB in the beginning and 93.9MB in the end (delta: -34.1MB). Peak memory consumption was 137.9MB. Max. memory is 16.1GB. * Witness Printer took 4.83ms. Allocated memory is still 268.4MB. Free memory was 93.9MB in the beginning and 93.8MB in the end (delta: 67.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L47] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L49] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L50] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L51] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L52] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L53] unsigned short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L54] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L55] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L56] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L57] double last_1_WrapperStruct00_var_1_7 = 0.2; [L58] unsigned long int last_1_WrapperStruct00_var_1_12 = 5; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=0, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L114] EXPR WrapperStruct00.var_1_7 [L114] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L115] EXPR WrapperStruct00.var_1_12 [L115] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L125] RET updateLastVariables() [L126] CALL updateVariables() [L93] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_3 [L94] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_3 [L94] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L95] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_4 [L96] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_4 [L96] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L97] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L102] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L103] WrapperStruct00.var_1_9 = __VERIFIER_nondet_ushort() [L104] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L107] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L110] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L111] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L126] RET updateVariables() [L127] CALL step() [L62] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L62] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L62] COND FALSE !(! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) [L69] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L69] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L71] (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) [L71] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L71] (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L71] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) [L78] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L78] (*(WrapperStruct00_var_1_7_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L80] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L89] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR (! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L118] EXPR (! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR ((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) [L118] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L118] EXPR (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) [L118] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L118] EXPR (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) [L118] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L118] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR ((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR (((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))))) && ((*(WrapperStruct00_var_1_8_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer)))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118-L119] return (((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))))) && ((*(WrapperStruct00_var_1_8_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer)))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 389 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 1491 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 924 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 936 IncrementalHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 567 mSDtfsCounter, 936 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 732 NumberOfCodeBlocks, 732 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 515 ConstructedInterpolants, 0 QuantifiedInterpolants, 4135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1320/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:59:05,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.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 c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:59:07,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:59:07,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:59:07,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:59:07,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:59:07,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:59:07,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:59:07,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:59:07,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:59:07,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:59:07,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:59:07,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:59:07,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:59:07,801 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:59:07,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:59:07,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:59:07,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:59:07,802 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 -> c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 [2024-11-07 10:59:08,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:59:08,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:59:08,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:59:08,018 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:59:08,018 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:59:08,019 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-7.i [2024-11-07 10:59:09,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:59:09,336 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:59:09,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.i [2024-11-07 10:59:09,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7791b6fd/c43c0b04183a4fa8a71e776f73bb18d1/FLAGe8e6b6a83 [2024-11-07 10:59:09,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7791b6fd/c43c0b04183a4fa8a71e776f73bb18d1 [2024-11-07 10:59:09,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:59:09,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:59:09,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:59:09,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:59:09,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:59:09,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f907cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09, skipping insertion in model container [2024-11-07 10:59:09,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:59:09,485 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-7.i[916,929] [2024-11-07 10:59:09,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:59:09,547 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:59:09,554 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-7.i[916,929] [2024-11-07 10:59:09,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:59:09,594 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:59:09,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09 WrapperNode [2024-11-07 10:59:09,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:59:09,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:59:09,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:59:09,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:59:09,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,644 INFO L138 Inliner]: procedures = 40, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 485 [2024-11-07 10:59:09,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:59:09,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:59:09,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:59:09,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:59:09,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,696 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2024-11-07 10:59:09,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:59:09,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:59:09,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:59:09,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:59:09,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09" (1/1) ... [2024-11-07 10:59:09,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:59:09,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:59:09,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:59:09,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:59:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:59:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:59:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:59:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-07 10:59:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-07 10:59:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:59:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:59:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:59:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:59:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:59:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:59:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:59:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:59:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:59:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:59:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:59:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:59:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:59:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:59:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:59:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:59:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-07 10:59:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-07 10:59:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:59:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:59:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:59:09,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:59:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:59:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:59:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:59:09,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:59:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:59:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:59:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:59:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:59:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:59:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:59:09,897 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:59:09,898 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:59:11,674 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-07 10:59:11,675 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:59:11,682 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:59:11,683 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:59:11,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:59:11 BoogieIcfgContainer [2024-11-07 10:59:11,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:59:11,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:59:11,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:59:11,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:59:11,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:59:09" (1/3) ... [2024-11-07 10:59:11,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f26bf7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:59:11, skipping insertion in model container [2024-11-07 10:59:11,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:59:09" (2/3) ... [2024-11-07 10:59:11,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f26bf7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:59:11, skipping insertion in model container [2024-11-07 10:59:11,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:59:11" (3/3) ... [2024-11-07 10:59:11,692 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-7.i [2024-11-07 10:59:11,700 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:59:11,701 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:59:11,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:59:11,744 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;@79dc2c80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:59:11,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:59:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 86 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:59:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:59:11,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:59:11,757 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:59:11,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:59:11,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:59:11,762 INFO L85 PathProgramCache]: Analyzing trace with hash 283445107, now seen corresponding path program 1 times [2024-11-07 10:59:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:59:11,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543249564] [2024-11-07 10:59:11,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:11,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 10:59:11,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:59:11,774 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:59:11,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 10:59:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:12,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:59:12,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:59:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-07 10:59:12,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:59:12,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:59:12,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543249564] [2024-11-07 10:59:12,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543249564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:59:12,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:59:12,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:59:12,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879925102] [2024-11-07 10:59:12,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:59:12,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:59:12,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:59:12,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:59:12,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:59:12,159 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 86 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:59:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:59:12,178 INFO L93 Difference]: Finished difference Result 193 states and 304 transitions. [2024-11-07 10:59:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:59:12,179 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-07 10:59:12,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:59:12,183 INFO L225 Difference]: With dead ends: 193 [2024-11-07 10:59:12,183 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 10:59:12,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:59:12,186 INFO L432 NwaCegarLoop]: 138 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, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:59:12,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:59:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 10:59:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-07 10:59:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:59:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-07 10:59:12,218 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 103 [2024-11-07 10:59:12,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:59:12,218 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-07 10:59:12,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:59:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-07 10:59:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:59:12,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:59:12,222 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:59:12,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 10:59:12,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:59:12,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:59:12,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:59:12,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1020890979, now seen corresponding path program 1 times [2024-11-07 10:59:12,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:59:12,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090770017] [2024-11-07 10:59:12,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:12,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:59:12,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:59:12,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:59:12,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 10:59:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:12,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 10:59:12,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:59:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:59:12,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:59:12,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:59:12,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090770017] [2024-11-07 10:59:12,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090770017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:59:12,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:59:12,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:59:12,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712214476] [2024-11-07 10:59:12,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:59:12,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:59:12,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:59:12,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:59:12,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:59:12,777 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:59:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:59:12,817 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2024-11-07 10:59:12,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:59:12,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-07 10:59:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:59:12,821 INFO L225 Difference]: With dead ends: 190 [2024-11-07 10:59:12,822 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 10:59:12,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:59:12,823 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:59:12,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:59:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 10:59:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-07 10:59:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:59:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-07 10:59:12,835 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 103 [2024-11-07 10:59:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:59:12,840 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-07 10:59:12,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:59:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-07 10:59:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:59:12,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:59:12,841 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:59:12,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 10:59:13,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:59:13,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:59:13,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:59:13,044 INFO L85 PathProgramCache]: Analyzing trace with hash 9773729, now seen corresponding path program 1 times [2024-11-07 10:59:13,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:59:13,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729973693] [2024-11-07 10:59:13,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:13,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:59:13,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:59:13,046 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:59:13,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 10:59:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:13,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:59:13,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:59:13,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-07 10:59:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:59:13,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:59:13,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:59:13,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729973693] [2024-11-07 10:59:13,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729973693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:59:13,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:59:13,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:59:13,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134916700] [2024-11-07 10:59:13,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:59:13,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:59:13,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:59:13,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:59:13,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:59:13,475 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:59:15,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:59:15,266 INFO L93 Difference]: Finished difference Result 192 states and 276 transitions. [2024-11-07 10:59:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:59:15,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-07 10:59:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:59:15,267 INFO L225 Difference]: With dead ends: 192 [2024-11-07 10:59:15,267 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 10:59:15,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:59:15,268 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 132 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:59:15,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 381 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 10:59:15,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 10:59:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-07 10:59:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:59:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2024-11-07 10:59:15,274 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 103 [2024-11-07 10:59:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:59:15,274 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2024-11-07 10:59:15,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:59:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2024-11-07 10:59:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:59:15,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:59:15,275 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:59:15,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 10:59:15,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:59:15,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:59:15,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:59:15,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1355702811, now seen corresponding path program 1 times [2024-11-07 10:59:15,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:59:15,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502625131] [2024-11-07 10:59:15,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:15,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:59:15,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:59:15,483 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:59:15,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 10:59:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:15,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:59:15,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:59:15,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-07 10:59:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:59:15,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:59:15,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:59:15,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502625131] [2024-11-07 10:59:15,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502625131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:59:15,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:59:15,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:59:15,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866345958] [2024-11-07 10:59:15,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:59:15,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:59:15,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:59:15,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:59:15,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:59:15,860 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:59:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:59:18,045 INFO L93 Difference]: Finished difference Result 192 states and 274 transitions. [2024-11-07 10:59:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:59:18,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-07 10:59:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:59:18,050 INFO L225 Difference]: With dead ends: 192 [2024-11-07 10:59:18,050 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 10:59:18,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:59:18,051 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 120 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:59:18,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 376 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-07 10:59:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 10:59:18,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-07 10:59:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:59:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2024-11-07 10:59:18,058 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 105 [2024-11-07 10:59:18,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:59:18,058 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2024-11-07 10:59:18,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:59:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2024-11-07 10:59:18,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:59:18,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:59:18,059 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:59:18,072 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 10:59:18,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:59:18,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:59:18,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:59:18,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1056718239, now seen corresponding path program 1 times [2024-11-07 10:59:18,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:59:18,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683434849] [2024-11-07 10:59:18,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:18,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:59:18,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:59:18,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:59:18,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 10:59:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:18,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 10:59:18,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:59:19,629 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 10:59:19,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:59:20,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 10:59:20,862 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 10:59:21,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-07 10:59:23,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2024-11-07 10:59:23,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2024-11-07 10:59:25,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2024-11-07 10:59:26,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:59:26,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 42 [2024-11-07 10:59:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 120 proven. 44 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-07 10:59:27,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:59:28,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:59:28,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683434849] [2024-11-07 10:59:28,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683434849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:59:28,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [280399232] [2024-11-07 10:59:28,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:28,003 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:59:28,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:59:28,022 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:59:28,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-07 10:59:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:29,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 10:59:29,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:59:30,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:59:30,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 10:59:30,793 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 10:59:32,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-07 10:59:33,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2024-11-07 10:59:36,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 61 [2024-11-07 10:59:40,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 80 [2024-11-07 10:59:41,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 86 [2024-11-07 10:59:43,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 102 treesize of output 54 [2024-11-07 10:59:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 152 proven. 44 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-07 10:59:43,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:59:44,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [280399232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:59:44,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:59:44,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2024-11-07 10:59:44,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912006900] [2024-11-07 10:59:44,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:59:44,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 10:59:44,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:59:44,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 10:59:44,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=368, Unknown=9, NotChecked=0, Total=462 [2024-11-07 10:59:44,382 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 17 states, 17 states have (on average 6.294117647058823) internal successors, (107), 16 states have internal predecessors, (107), 7 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-07 10:59:50,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:59:54,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:59:58,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 11:00:02,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 11:00:14,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 11:00:17,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 11:00:20,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 11:00:24,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 11:00:26,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 11:00:28,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 11:00:29,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 11:00:32,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 11:00:33,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 11:00:35,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]