./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.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_loopvsstraightlinecode_50-1loop_file-55.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', 'de1fbf367ada53f961df067d70787da2faa8a89922a9e8e492dc1c883e977a05'] 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_loopvsstraightlinecode_50-1loop_file-55.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 de1fbf367ada53f961df067d70787da2faa8a89922a9e8e492dc1c883e977a05 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:43:51,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:43:51,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:43:51,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:43:51,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:43:51,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:43:51,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:43:51,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:43:51,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:43:51,289 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:43:51,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:43:51,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:43:51,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:43:51,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:43:51,290 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:43:51,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:43:51,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:43:51,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:43:51,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:43:51,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:43:51,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:43:51,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:43:51,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:43:51,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:43:51,292 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:43:51,293 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:43:51,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:43:51,293 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:43:51,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:43:51,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:43:51,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:43:51,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:43:51,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:43:51,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:43:51,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:43:51,294 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:43:51,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:43:51,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:43:51,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:43:51,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:43:51,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:43:51,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:43:51,295 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 -> de1fbf367ada53f961df067d70787da2faa8a89922a9e8e492dc1c883e977a05 [2024-11-07 08:43:51,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:43:51,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:43:51,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:43:51,507 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:43:51,507 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:43:51,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i [2024-11-07 08:43:52,741 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:43:52,920 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:43:52,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i [2024-11-07 08:43:52,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c5bdab5a/1310c3337a1e46f88b15902b8d61c019/FLAGc7ac0e8b2 [2024-11-07 08:43:52,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c5bdab5a/1310c3337a1e46f88b15902b8d61c019 [2024-11-07 08:43:52,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:43:52,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:43:52,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:43:52,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:43:52,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:43:52,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:43:52" (1/1) ... [2024-11-07 08:43:52,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673f2f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:52, skipping insertion in model container [2024-11-07 08:43:52,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:43:52" (1/1) ... [2024-11-07 08:43:52,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:43:53,070 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_loopvsstraightlinecode_50-1loop_file-55.i[915,928] [2024-11-07 08:43:53,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:43:53,125 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:43:53,134 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_loopvsstraightlinecode_50-1loop_file-55.i[915,928] [2024-11-07 08:43:53,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:43:53,181 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:43:53,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53 WrapperNode [2024-11-07 08:43:53,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:43:53,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:43:53,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:43:53,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:43:53,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53" (1/1) ... [2024-11-07 08:43:53,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53" (1/1) ... [2024-11-07 08:43:53,226 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-07 08:43:53,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:43:53,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:43:53,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:43:53,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:43:53,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53" (1/1) ... [2024-11-07 08:43:53,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53" (1/1) ... [2024-11-07 08:43:53,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53" (1/1) ... [2024-11-07 08:43:53,263 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:43:53,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53" (1/1) ... [2024-11-07 08:43:53,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53" (1/1) ... [2024-11-07 08:43:53,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53" (1/1) ... [2024-11-07 08:43:53,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53" (1/1) ... [2024-11-07 08:43:53,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53" (1/1) ... [2024-11-07 08:43:53,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53" (1/1) ... [2024-11-07 08:43:53,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:43:53,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:43:53,292 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:43:53,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:43:53,293 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53" (1/1) ... [2024-11-07 08:43:53,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:43:53,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:43:53,320 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 08:43:53,325 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 08:43:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:43:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:43:53,341 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:43:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:43:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:43:53,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:43:53,411 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:43:53,412 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:43:53,617 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-07 08:43:53,617 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:43:53,623 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:43:53,624 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:43:53,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:43:53 BoogieIcfgContainer [2024-11-07 08:43:53,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:43:53,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:43:53,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:43:53,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:43:53,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:43:52" (1/3) ... [2024-11-07 08:43:53,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18486304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:43:53, skipping insertion in model container [2024-11-07 08:43:53,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:53" (2/3) ... [2024-11-07 08:43:53,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18486304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:43:53, skipping insertion in model container [2024-11-07 08:43:53,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:43:53" (3/3) ... [2024-11-07 08:43:53,638 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-55.i [2024-11-07 08:43:53,655 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:43:53,656 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:43:53,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:43:53,710 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;@1c234ae8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:43:53,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:43:53,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 08:43:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 08:43:53,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:43:53,724 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:43:53,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:43:53,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:43:53,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1893151705, now seen corresponding path program 1 times [2024-11-07 08:43:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:43:53,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495240911] [2024-11-07 08:43:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:43:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:43:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:43:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:53,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:43:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:53,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:43:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:53,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:43:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:43:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:43:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:43:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 08:43:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:43:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:43:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:43:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:43:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:43:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:43:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:43:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:43:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:43:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:43:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:43:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:43:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:43:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:43:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:43:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:43:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:43:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 08:43:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:43:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 08:43:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:43:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 08:43:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 08:43:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 08:43:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:43:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495240911] [2024-11-07 08:43:54,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495240911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:43:54,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:43:54,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:43:54,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410972518] [2024-11-07 08:43:54,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:43:54,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:43:54,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:43:54,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:43:54,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:43:54,156 INFO L87 Difference]: Start difference. First operand has 75 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 08:43:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:43:54,179 INFO L93 Difference]: Finished difference Result 147 states and 258 transitions. [2024-11-07 08:43:54,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:43:54,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 186 [2024-11-07 08:43:54,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:43:54,186 INFO L225 Difference]: With dead ends: 147 [2024-11-07 08:43:54,186 INFO L226 Difference]: Without dead ends: 71 [2024-11-07 08:43:54,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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 08:43:54,193 INFO L432 NwaCegarLoop]: 111 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, 111 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 08:43:54,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:43:54,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-07 08:43:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-07 08:43:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 08:43:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 107 transitions. [2024-11-07 08:43:54,236 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 107 transitions. Word has length 186 [2024-11-07 08:43:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:43:54,237 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 107 transitions. [2024-11-07 08:43:54,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 08:43:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 107 transitions. [2024-11-07 08:43:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 08:43:54,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:43:54,243 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:43:54,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:43:54,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:43:54,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:43:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash 977478445, now seen corresponding path program 1 times [2024-11-07 08:43:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:43:54,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738007369] [2024-11-07 08:43:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:43:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:43:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:43:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:43:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:43:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:43:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:43:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:43:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:43:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 08:43:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:43:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:43:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:43:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:43:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:43:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:43:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:43:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:43:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:43:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:43:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:43:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:43:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:43:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:43:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:43:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:43:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:43:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 08:43:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:43:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 08:43:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:43:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 08:43:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 08:43:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:43:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 08:43:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:43:55,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738007369] [2024-11-07 08:43:55,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738007369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:43:55,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:43:55,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:43:55,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554821785] [2024-11-07 08:43:55,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:43:55,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:43:55,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:43:55,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:43:55,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:43:55,194 INFO L87 Difference]: Start difference. First operand 71 states and 107 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 08:43:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:43:55,527 INFO L93 Difference]: Finished difference Result 193 states and 288 transitions. [2024-11-07 08:43:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:43:55,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 186 [2024-11-07 08:43:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:43:55,529 INFO L225 Difference]: With dead ends: 193 [2024-11-07 08:43:55,529 INFO L226 Difference]: Without dead ends: 125 [2024-11-07 08:43:55,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:43:55,530 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 130 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:43:55,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 217 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:43:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-07 08:43:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2024-11-07 08:43:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 08:43:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-11-07 08:43:55,554 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 186 [2024-11-07 08:43:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:43:55,554 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-11-07 08:43:55,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 08:43:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-11-07 08:43:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 08:43:55,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:43:55,556 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:43:55,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:43:55,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:43:55,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:43:55,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1036583789, now seen corresponding path program 1 times [2024-11-07 08:43:55,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:43:55,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025704260] [2024-11-07 08:43:55,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:43:55,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:43:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:43:55,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753517740] [2024-11-07 08:43:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:43:55,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:43:55,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:43:55,648 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 08:43:55,649 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 08:43:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:43:55,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:43:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:43:55,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:43:55,926 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:43:55,927 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:43:55,940 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 08:43:56,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:43:56,133 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 08:43:56,256 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:43:56,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:43:56 BoogieIcfgContainer [2024-11-07 08:43:56,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:43:56,263 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:43:56,263 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:43:56,263 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:43:56,264 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:43:53" (3/4) ... [2024-11-07 08:43:56,265 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:43:56,266 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:43:56,267 INFO L158 Benchmark]: Toolchain (without parser) took 3321.30ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 92.9MB in the beginning and 129.5MB in the end (delta: -36.6MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-07 08:43:56,268 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:43:56,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.54ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 78.7MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:43:56,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.85ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 76.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:43:56,269 INFO L158 Benchmark]: Boogie Preprocessor took 59.46ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 73.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:43:56,269 INFO L158 Benchmark]: RCFGBuilder took 332.75ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 54.2MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:43:56,269 INFO L158 Benchmark]: TraceAbstraction took 2636.46ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 53.6MB in the beginning and 129.5MB in the end (delta: -75.9MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2024-11-07 08:43:56,269 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 129.5MB in the end (delta: 63.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:43:56,270 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.20ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.54ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 78.7MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.85ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 76.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.46ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 73.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 332.75ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 54.2MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2636.46ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 53.6MB in the beginning and 129.5MB in the end (delta: -75.9MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 129.5MB in the end (delta: 63.5kB). 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 someBinaryDOUBLEComparisonOperation at line 138. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.8; [L23] double var_1_6 = 127.5; [L24] double var_1_7 = 2.6; [L25] double var_1_8 = 4.5; [L26] signed short int var_1_9 = -128; [L27] signed short int var_1_10 = 16; [L28] signed short int var_1_11 = 4; [L29] signed short int var_1_12 = 100; [L30] signed short int var_1_13 = 64; [L31] signed short int var_1_14 = 2; [L32] signed long int var_1_15 = 5; [L33] signed char var_1_17 = -2; [L34] signed char var_1_18 = -4; [L35] signed char var_1_19 = 8; [L36] signed char var_1_20 = 10; [L37] unsigned long int var_1_21 = 25; [L38] unsigned long int var_1_22 = 3797799060; [L39] unsigned char var_1_23 = 1; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 0; [L42] unsigned char var_1_26 = 0; [L43] signed short int var_1_27 = -4; [L44] signed short int var_1_28 = 24644; [L45] signed char var_1_29 = 1; [L46] signed char var_1_30 = -1; [L47] unsigned char var_1_31 = 0; VAL [isInitial=0, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_6=255/2, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L142] isInitial = 1 [L143] FCALL initially() [L144] int k_loop; [L145] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_6=255/2, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L145] COND TRUE k_loop < 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L86] var_1_6 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L87] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L88] var_1_7 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_8=9/2, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_8=9/2, var_1_9=-128] [L89] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_8=9/2, var_1_9=-128] [L90] var_1_8 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L91] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L92] var_1_10 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L93] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L94] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L94] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L95] var_1_11 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L96] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L97] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L97] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L98] var_1_12 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L99] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L100] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L100] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L101] var_1_13 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L102] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L103] CALL assume_abort_if_not(var_1_13 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L103] RET assume_abort_if_not(var_1_13 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L104] var_1_14 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L105] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L106] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L106] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L107] var_1_18 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L108] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L109] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L109] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L110] var_1_19 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L111] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L112] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L112] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L113] var_1_20 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L114] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L115] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L115] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L116] var_1_22 = __VERIFIER_nondet_ulong() [L117] CALL assume_abort_if_not(var_1_22 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L117] RET assume_abort_if_not(var_1_22 >= 3221225470) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L118] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L118] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L119] var_1_24 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L120] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L121] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L121] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L122] var_1_25 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L123] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L124] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L124] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L125] var_1_26 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L126] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L127] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L127] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L128] var_1_28 = __VERIFIER_nondet_short() [L129] CALL assume_abort_if_not(var_1_28 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L129] RET assume_abort_if_not(var_1_28 >= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L130] CALL assume_abort_if_not(var_1_28 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L130] RET assume_abort_if_not(var_1_28 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L131] var_1_30 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_30 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_9=-128] [L132] RET assume_abort_if_not(var_1_30 >= -126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_9=-128] [L133] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_9=-128] [L133] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_9=-128] [L147] RET updateVariables() [L148] CALL step() [L51] var_1_9 = (((((var_1_10 - var_1_11)) < (((var_1_12 + var_1_13) - var_1_14))) ? ((var_1_10 - var_1_11)) : (((var_1_12 + var_1_13) - var_1_14)))) [L52] var_1_17 = (var_1_18 + (var_1_19 - var_1_20)) [L53] var_1_29 = (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_20) [L54] var_1_31 = var_1_26 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=44/5, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-2, var_1_30=1, var_1_31=0, var_1_9=0] [L55] COND FALSE !(var_1_17 <= (var_1_17 * (var_1_29 * var_1_29))) [L62] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-2, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L64] COND FALSE !(\read(var_1_31)) [L67] var_1_23 = (var_1_24 && (var_1_25 && var_1_26)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-2, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L69] COND FALSE !((- ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))) >= -0.875) [L76] var_1_27 = ((((var_1_29) < (var_1_28)) ? (var_1_29) : (var_1_28))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-2, var_1_28=16383, var_1_29=-2, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L78] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-2, var_1_28=16383, var_1_29=-2, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L81] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-2, var_1_28=16383, var_1_29=-2, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L148] RET step() [L149] CALL, EXPR property() [L138-L139] return (((((((((var_1_17 <= (var_1_17 * (var_1_29 * var_1_29))) ? ((var_1_29 > var_1_29) ? (var_1_1 == ((double) (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))) + var_1_8))) : (var_1_1 == ((double) var_1_8))) : (var_1_1 == ((double) var_1_7))) && (var_1_9 == ((signed short int) (((((var_1_10 - var_1_11)) < (((var_1_12 + var_1_13) - var_1_14))) ? ((var_1_10 - var_1_11)) : (((var_1_12 + var_1_13) - var_1_14))))))) && (var_1_23 ? (var_1_15 == ((signed long int) (var_1_14 - var_1_13))) : 1)) && (var_1_17 == ((signed char) (var_1_18 + (var_1_19 - var_1_20))))) && (var_1_23 ? (var_1_21 == ((unsigned long int) ((var_1_22 - (1000000000u - var_1_13)) - var_1_14))) : 1)) && (var_1_31 ? (var_1_23 == ((unsigned char) (var_1_24 && var_1_25))) : (var_1_23 == ((unsigned char) (var_1_24 && (var_1_25 && var_1_26)))))) && (((- ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))) >= -0.875) ? (var_1_31 ? (var_1_27 == ((signed short int) (var_1_19 - var_1_12))) : (var_1_27 == ((signed short int) (var_1_13 - (var_1_28 - (var_1_20 + var_1_19)))))) : (var_1_27 == ((signed short int) ((((var_1_29) < (var_1_28)) ? (var_1_29) : (var_1_28))))))) && (var_1_29 == ((signed char) (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_20)))) && (var_1_31 == ((unsigned char) var_1_26)) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-2, var_1_28=16383, var_1_29=-2, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-2, var_1_28=16383, var_1_29=-2, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=3, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-2, var_1_28=16383, var_1_29=-2, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 328 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 270 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 370 ConstructedInterpolants, 0 QuantifiedInterpolants, 444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 3720/3720 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 08:43:56,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.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 de1fbf367ada53f961df067d70787da2faa8a89922a9e8e492dc1c883e977a05 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:43:58,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:43:58,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:43:58,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:43:58,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:43:58,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:43:58,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:43:58,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:43:58,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:43:58,371 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:43:58,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:43:58,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:43:58,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:43:58,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:43:58,372 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:43:58,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:43:58,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:43:58,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:43:58,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:43:58,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:43:58,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:43:58,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:43:58,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:43:58,373 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:43:58,373 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:43:58,373 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:43:58,373 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:43:58,374 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:43:58,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:43:58,374 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:43:58,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:43:58,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:43:58,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:43:58,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:43:58,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:43:58,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:43:58,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:43:58,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:43:58,375 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:43:58,375 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:43:58,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:43:58,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:43:58,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:43:58,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:43:58,376 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 -> de1fbf367ada53f961df067d70787da2faa8a89922a9e8e492dc1c883e977a05 [2024-11-07 08:43:58,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:43:58,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:43:58,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:43:58,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:43:58,642 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:43:58,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i [2024-11-07 08:43:59,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:44:00,163 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:44:00,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i [2024-11-07 08:44:00,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3051341f/5e07858de0534bb28604f58402c1d7f9/FLAGc67dee0f2 [2024-11-07 08:44:00,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3051341f/5e07858de0534bb28604f58402c1d7f9 [2024-11-07 08:44:00,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:44:00,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:44:00,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:44:00,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:44:00,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:44:00,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@104af4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00, skipping insertion in model container [2024-11-07 08:44:00,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:44:00,328 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_loopvsstraightlinecode_50-1loop_file-55.i[915,928] [2024-11-07 08:44:00,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:44:00,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:44:00,402 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_loopvsstraightlinecode_50-1loop_file-55.i[915,928] [2024-11-07 08:44:00,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:44:00,452 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:44:00,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00 WrapperNode [2024-11-07 08:44:00,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:44:00,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:44:00,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:44:00,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:44:00,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,490 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-07 08:44:00,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:44:00,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:44:00,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:44:00,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:44:00,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,522 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:44:00,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,528 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:44:00,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:44:00,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:44:00,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:44:00,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00" (1/1) ... [2024-11-07 08:44:00,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:44:00,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:44:00,580 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 08:44:00,594 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 08:44:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:44:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:44:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:44:00,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:44:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:44:00,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:44:00,683 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:44:00,684 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:44:01,012 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-07 08:44:01,012 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:44:01,044 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:44:01,044 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:44:01,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:44:01 BoogieIcfgContainer [2024-11-07 08:44:01,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:44:01,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:44:01,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:44:01,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:44:01,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:44:00" (1/3) ... [2024-11-07 08:44:01,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273d3056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:44:01, skipping insertion in model container [2024-11-07 08:44:01,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:44:00" (2/3) ... [2024-11-07 08:44:01,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273d3056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:44:01, skipping insertion in model container [2024-11-07 08:44:01,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:44:01" (3/3) ... [2024-11-07 08:44:01,051 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-55.i [2024-11-07 08:44:01,060 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:44:01,061 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:44:01,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:44:01,109 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;@5b7de302, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:44:01,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:44:01,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 08:44:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 08:44:01,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:44:01,125 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:44:01,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:44:01,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:44:01,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1893151705, now seen corresponding path program 1 times [2024-11-07 08:44:01,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:44:01,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282470822] [2024-11-07 08:44:01,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:44:01,140 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 08:44:01,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:44:01,148 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 08:44:01,155 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 08:44:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:44:01,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:44:01,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:44:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2024-11-07 08:44:01,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:44:01,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:44:01,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282470822] [2024-11-07 08:44:01,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282470822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:44:01,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:44:01,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:44:01,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460727010] [2024-11-07 08:44:01,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:44:01,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:44:01,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:44:01,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:44:01,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:44:01,423 INFO L87 Difference]: Start difference. First operand has 75 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 08:44:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:44:01,451 INFO L93 Difference]: Finished difference Result 147 states and 258 transitions. [2024-11-07 08:44:01,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:44:01,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 186 [2024-11-07 08:44:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:44:01,459 INFO L225 Difference]: With dead ends: 147 [2024-11-07 08:44:01,459 INFO L226 Difference]: Without dead ends: 71 [2024-11-07 08:44:01,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 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 08:44:01,464 INFO L432 NwaCegarLoop]: 111 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, 111 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 08:44:01,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:44:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-07 08:44:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-07 08:44:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 08:44:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 107 transitions. [2024-11-07 08:44:01,507 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 107 transitions. Word has length 186 [2024-11-07 08:44:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:44:01,507 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 107 transitions. [2024-11-07 08:44:01,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 08:44:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 107 transitions. [2024-11-07 08:44:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 08:44:01,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:44:01,510 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:44:01,519 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 (2)] Forceful destruction successful, exit code 0 [2024-11-07 08:44:01,717 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 08:44:01,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:44:01,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:44:01,719 INFO L85 PathProgramCache]: Analyzing trace with hash 977478445, now seen corresponding path program 1 times [2024-11-07 08:44:01,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:44:01,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903261580] [2024-11-07 08:44:01,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:44:01,720 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 08:44:01,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:44:01,723 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 08:44:01,724 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 08:44:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:44:01,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 08:44:01,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:44:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 498 proven. 12 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2024-11-07 08:44:02,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:44:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 78 proven. 12 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-07 08:44:02,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:44:02,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903261580] [2024-11-07 08:44:02,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903261580] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:44:02,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:44:02,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-07 08:44:02,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73163454] [2024-11-07 08:44:02,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:44:02,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:44:02,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:44:02,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:44:02,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:44:02,389 INFO L87 Difference]: Start difference. First operand 71 states and 107 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-07 08:44:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:44:03,059 INFO L93 Difference]: Finished difference Result 219 states and 325 transitions. [2024-11-07 08:44:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 08:44:03,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 186 [2024-11-07 08:44:03,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:44:03,062 INFO L225 Difference]: With dead ends: 219 [2024-11-07 08:44:03,062 INFO L226 Difference]: Without dead ends: 151 [2024-11-07 08:44:03,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:44:03,063 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 168 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 08:44:03,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 311 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 08:44:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-07 08:44:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 79. [2024-11-07 08:44:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 08:44:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 116 transitions. [2024-11-07 08:44:03,078 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 116 transitions. Word has length 186 [2024-11-07 08:44:03,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:44:03,079 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 116 transitions. [2024-11-07 08:44:03,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-07 08:44:03,079 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 116 transitions. [2024-11-07 08:44:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 08:44:03,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:44:03,081 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:44:03,090 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 08:44:03,281 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 08:44:03,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:44:03,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:44:03,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1036583789, now seen corresponding path program 1 times [2024-11-07 08:44:03,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:44:03,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195871058] [2024-11-07 08:44:03,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:44:03,283 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 08:44:03,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:44:03,285 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 08:44:03,287 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 08:44:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:44:03,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-07 08:44:04,006 INFO L278 TraceCheckSpWp]: Computing forward predicates...