./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-40.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_codestructure_steplocals_file-40.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', '77fbc3ec0aa1e3a17f6dd73b5c59e0107945f53ef89e3fc3ca652830ca5bf043'] 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_codestructure_steplocals_file-40.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 77fbc3ec0aa1e3a17f6dd73b5c59e0107945f53ef89e3fc3ca652830ca5bf043 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:20:42,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:20:42,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:20:42,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:20:42,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:20:42,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:20:42,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:20:42,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:20:42,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:20:42,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:20:42,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:20:42,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:20:42,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:20:42,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:20:42,166 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:20:42,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:20:42,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:20:42,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:20:42,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:20:42,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:20:42,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:20:42,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:20:42,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:20:42,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:20:42,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:20:42,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:20:42,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:20:42,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:20:42,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:20:42,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:20:42,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:20:42,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:20:42,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:20:42,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:20:42,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:20:42,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:20:42,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:20:42,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:20:42,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:20:42,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:20:42,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:20:42,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:20:42,169 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 -> 77fbc3ec0aa1e3a17f6dd73b5c59e0107945f53ef89e3fc3ca652830ca5bf043 [2024-11-07 04:20:42,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:20:42,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:20:42,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:20:42,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:20:42,397 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:20:42,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-40.i [2024-11-07 04:20:43,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:20:43,676 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:20:43,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-40.i [2024-11-07 04:20:43,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c41d4365/1db7f3ec8323407e96732b6a55e4a293/FLAG570279573 [2024-11-07 04:20:44,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c41d4365/1db7f3ec8323407e96732b6a55e4a293 [2024-11-07 04:20:44,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:20:44,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:20:44,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:20:44,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:20:44,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:20:44,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413f8526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44, skipping insertion in model container [2024-11-07 04:20:44,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:20:44,132 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_codestructure_steplocals_file-40.i[917,930] [2024-11-07 04:20:44,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:20:44,190 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:20:44,197 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_codestructure_steplocals_file-40.i[917,930] [2024-11-07 04:20:44,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:20:44,225 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:20:44,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44 WrapperNode [2024-11-07 04:20:44,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:20:44,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:20:44,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:20:44,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:20:44,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,277 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-11-07 04:20:44,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:20:44,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:20:44,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:20:44,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:20:44,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,310 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 04:20:44,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:20:44,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:20:44,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:20:44,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:20:44,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44" (1/1) ... [2024-11-07 04:20:44,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:20:44,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:20:44,365 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 04:20:44,370 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 04:20:44,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:20:44,385 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:20:44,386 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:20:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:20:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:20:44,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:20:44,455 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:20:44,457 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:20:44,775 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 04:20:44,776 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:20:44,782 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:20:44,786 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:20:44,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:20:44 BoogieIcfgContainer [2024-11-07 04:20:44,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:20:44,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:20:44,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:20:44,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:20:44,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:20:44" (1/3) ... [2024-11-07 04:20:44,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4206564e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:20:44, skipping insertion in model container [2024-11-07 04:20:44,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:44" (2/3) ... [2024-11-07 04:20:44,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4206564e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:20:44, skipping insertion in model container [2024-11-07 04:20:44,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:20:44" (3/3) ... [2024-11-07 04:20:44,794 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-40.i [2024-11-07 04:20:44,804 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:20:44,804 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:20:44,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:20:44,857 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;@2df341f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:20:44,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:20:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 46 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 04:20:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-07 04:20:44,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:20:44,871 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:20:44,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:20:44,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:20:44,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2024668306, now seen corresponding path program 1 times [2024-11-07 04:20:44,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:20:44,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622865968] [2024-11-07 04:20:44,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:20:44,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:20:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:20:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:20:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:20:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:20:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:20:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:20:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:20:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:20:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:20:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:20:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:20:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:20:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:20:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:20:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:20:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:20:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 04:20:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:20:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 04:20:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:20:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:20:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:20:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:20:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:20:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:20:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 04:20:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 04:20:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 04:20:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 04:20:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 04:20:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-07 04:20:45,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:20:45,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622865968] [2024-11-07 04:20:45,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622865968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:20:45,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:20:45,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:20:45,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437419869] [2024-11-07 04:20:45,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:20:45,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:20:45,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:20:45,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:20:45,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:20:45,254 INFO L87 Difference]: Start difference. First operand has 78 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 46 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-07 04:20:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:20:45,281 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2024-11-07 04:20:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:20:45,282 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 185 [2024-11-07 04:20:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:20:45,286 INFO L225 Difference]: With dead ends: 149 [2024-11-07 04:20:45,287 INFO L226 Difference]: Without dead ends: 74 [2024-11-07 04:20:45,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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 04:20:45,293 INFO L432 NwaCegarLoop]: 110 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, 110 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 04:20:45,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:20:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-07 04:20:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-07 04:20:45,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 04:20:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 110 transitions. [2024-11-07 04:20:45,327 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 110 transitions. Word has length 185 [2024-11-07 04:20:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:20:45,327 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 110 transitions. [2024-11-07 04:20:45,328 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-07 04:20:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 110 transitions. [2024-11-07 04:20:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 04:20:45,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:20:45,330 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:20:45,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:20:45,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:20:45,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:20:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1430106525, now seen corresponding path program 1 times [2024-11-07 04:20:45,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:20:45,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409369544] [2024-11-07 04:20:45,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:20:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:20:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:20:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:20:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:20:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:20:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:20:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:20:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:20:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:20:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:20:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:20:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:20:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:20:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:20:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:20:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:20:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:20:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 04:20:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:20:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 04:20:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:20:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:20:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:20:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:20:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:20:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:20:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 04:20:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 04:20:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 04:20:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 04:20:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 04:20:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-07 04:20:45,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:20:45,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409369544] [2024-11-07 04:20:45,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409369544] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:20:45,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146046340] [2024-11-07 04:20:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:20:45,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:20:45,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:20:45,883 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 04:20:45,884 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 04:20:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:46,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 04:20:46,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:20:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-07 04:20:46,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:20:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-07 04:20:46,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146046340] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:20:46,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 04:20:46,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 04:20:46,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697614347] [2024-11-07 04:20:46,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 04:20:46,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 04:20:46,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:20:46,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 04:20:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:20:46,456 INFO L87 Difference]: Start difference. First operand 74 states and 110 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-07 04:20:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:20:46,696 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2024-11-07 04:20:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 04:20:46,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 186 [2024-11-07 04:20:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:20:46,698 INFO L225 Difference]: With dead ends: 151 [2024-11-07 04:20:46,698 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 04:20:46,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 428 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:20:46,699 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 95 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:20:46,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 144 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:20:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 04:20:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-07 04:20:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 04:20:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 107 transitions. [2024-11-07 04:20:46,711 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 107 transitions. Word has length 186 [2024-11-07 04:20:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:20:46,711 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 107 transitions. [2024-11-07 04:20:46,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-07 04:20:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 107 transitions. [2024-11-07 04:20:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 04:20:46,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:20:46,713 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:20:46,728 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 04:20:46,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:20:46,914 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:20:46,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:20:46,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2110164895, now seen corresponding path program 1 times [2024-11-07 04:20:46,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:20:46,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546650027] [2024-11-07 04:20:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:20:46,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:20:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:20:47,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [911533299] [2024-11-07 04:20:47,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:20:47,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:20:47,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:20:47,011 INFO L229 MonitoredProcess]: Starting monitored process 3 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 04:20:47,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 04:20:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:20:47,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:20:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:20:47,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:20:47,259 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:20:47,260 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:20:47,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 04:20:47,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:20:47,464 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 04:20:47,539 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:20:47,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:20:47 BoogieIcfgContainer [2024-11-07 04:20:47,541 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:20:47,541 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:20:47,542 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:20:47,542 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:20:47,542 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:20:44" (3/4) ... [2024-11-07 04:20:47,544 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:20:47,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:20:47,545 INFO L158 Benchmark]: Toolchain (without parser) took 3512.27ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.6MB in the beginning and 79.0MB in the end (delta: -2.4MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-11-07 04:20:47,545 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 48.0MB in the beginning and 48.0MB in the end (delta: 77.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:20:47,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.89ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 62.2MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:20:47,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.66ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 58.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:20:47,545 INFO L158 Benchmark]: Boogie Preprocessor took 55.17ms. Allocated memory is still 100.7MB. Free memory was 58.5MB in the beginning and 52.4MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:20:47,546 INFO L158 Benchmark]: RCFGBuilder took 451.59ms. Allocated memory is still 100.7MB. Free memory was 52.4MB in the beginning and 67.9MB in the end (delta: -15.4MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-11-07 04:20:47,547 INFO L158 Benchmark]: TraceAbstraction took 2753.37ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 67.4MB in the beginning and 79.0MB in the end (delta: -11.6MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2024-11-07 04:20:47,547 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 125.8MB. Free memory was 79.0MB in the beginning and 79.0MB in the end (delta: 30.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:20:47,548 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 48.0MB in the beginning and 48.0MB in the end (delta: 77.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.89ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 62.2MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.66ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 58.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.17ms. Allocated memory is still 100.7MB. Free memory was 58.5MB in the beginning and 52.4MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 451.59ms. Allocated memory is still 100.7MB. Free memory was 52.4MB in the beginning and 67.9MB in the end (delta: -15.4MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2753.37ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 67.4MB in the beginning and 79.0MB in the end (delta: -11.6MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 125.8MB. Free memory was 79.0MB in the beginning and 79.0MB in the end (delta: 30.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 140, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someUnaryDOUBLEoperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed char var_1_2 = 2; [L24] signed char var_1_3 = -100; [L25] signed short int var_1_4 = -200; [L26] signed long int var_1_5 = -2; [L27] unsigned short int var_1_6 = 32; [L28] unsigned short int var_1_7 = 8; [L29] unsigned short int var_1_8 = 5; [L30] unsigned char var_1_9 = 1; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 0; [L33] unsigned char var_1_12 = 16; [L34] double var_1_13 = 4.8; [L35] double var_1_14 = 8.4; [L36] unsigned char var_1_15 = 50; [L37] unsigned short int var_1_16 = 1; [L38] float var_1_17 = 25.4; [L39] signed long int var_1_19 = 2; [L40] float var_1_20 = 1.6; [L41] unsigned short int var_1_21 = 0; [L42] unsigned short int var_1_22 = 8; [L43] unsigned short int var_1_23 = 16; [L44] float var_1_24 = 128.5; [L45] double var_1_25 = -0.5; [L46] signed long int var_1_26 = 4; VAL [isInitial=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=2, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L144] isInitial = 1 [L145] FCALL initially() [L146] COND TRUE 1 [L147] FCALL updateLastVariables() [L148] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L91] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L92] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L93] var_1_3 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L94] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L95] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L95] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L96] var_1_4 = __VERIFIER_nondet_short() [L97] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L97] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L98] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L98] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L99] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L99] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L100] var_1_5 = __VERIFIER_nondet_long() [L101] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L101] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L102] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L102] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L103] var_1_6 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_7=8, var_1_8=5, var_1_9=1] [L104] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_7=8, var_1_8=5, var_1_9=1] [L105] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=8, var_1_8=5, var_1_9=1] [L105] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=8, var_1_8=5, var_1_9=1] [L106] var_1_7 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_8=5, var_1_9=1] [L107] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_8=5, var_1_9=1] [L108] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=5, var_1_9=1] [L108] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=5, var_1_9=1] [L109] var_1_8 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_9=1] [L110] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_9=1] [L111] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L111] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L112] var_1_10 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L113] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L114] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L114] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L115] var_1_11 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L116] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L117] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L117] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L118] var_1_13 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L119] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L120] var_1_14 = __VERIFIER_nondet_double() [L121] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L121] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L122] var_1_15 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L123] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L124] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L125] var_1_19 = __VERIFIER_nondet_long() [L126] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L126] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L127] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L127] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L128] var_1_20 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L129] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L130] var_1_22 = __VERIFIER_nondet_ushort() [L131] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L131] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=65536, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=65536, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L132] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=65536, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L133] var_1_23 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=65536, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=65536, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L134] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=65536, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L135] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L148] RET updateVariables() [L149] CALL step() [L50] signed long int stepLocal_0 = (var_1_3 * var_1_2) / var_1_4; VAL [isInitial=1, stepLocal_0=3, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L51] COND TRUE stepLocal_0 <= var_1_5 [L52] var_1_1 = var_1_6 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L56] unsigned char stepLocal_1 = var_1_5 != var_1_4; VAL [isInitial=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L57] COND TRUE stepLocal_1 || var_1_10 [L58] var_1_9 = var_1_11 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L60] COND FALSE !((var_1_9 && var_1_11) && (50 > var_1_8)) [L67] var_1_12 = var_1_15 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L69] var_1_16 = (((((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) < (var_1_15)) ? ((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) : (var_1_15))) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L70] COND TRUE (var_1_1 - ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (var_1_8 - var_1_19) [L71] var_1_17 = var_1_20 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L73] COND FALSE !((var_1_10 && var_1_11) && var_1_9) [L76] var_1_21 = ((23370 - var_1_15) + var_1_23) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L78] unsigned char stepLocal_2 = var_1_12; VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L79] COND FALSE !(! (-4 < var_1_22)) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L82] COND FALSE !(-4 > stepLocal_2) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L86] var_1_25 = var_1_20 [L87] var_1_26 = var_1_6 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L149] RET step() [L150] CALL, EXPR property() [L140-L141] return (((((((((((var_1_3 * var_1_2) / var_1_4) <= var_1_5) ? (var_1_1 == ((unsigned short int) var_1_6)) : (var_1_1 == ((unsigned short int) (var_1_7 + var_1_8)))) && (((var_1_5 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- var_1_13) < var_1_14) ? (var_1_10 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) < (var_1_15)) ? ((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) : (var_1_15)))))) && (((var_1_1 - ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (var_1_8 - var_1_19)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_10 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_12 + (var_1_15 + ((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_23))))) && ((! (-4 < var_1_22)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_12) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_6)) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L150] RET, EXPR property() [L150] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=7, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 179 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 530 GetRequests, 520 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 929 NumberOfCodeBlocks, 929 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 739 ConstructedInterpolants, 0 QuantifiedInterpolants, 1273 SizeOfPredicates, 1 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6861/6960 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 04:20:47,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-40.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 77fbc3ec0aa1e3a17f6dd73b5c59e0107945f53ef89e3fc3ca652830ca5bf043 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:20:49,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:20:49,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:20:49,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:20:49,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:20:49,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:20:49,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:20:49,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:20:49,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:20:49,370 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:20:49,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:20:49,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:20:49,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:20:49,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:20:49,371 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:20:49,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:20:49,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:20:49,371 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:20:49,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:20:49,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:20:49,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:20:49,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:20:49,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:20:49,371 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:20:49,371 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:20:49,371 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:20:49,371 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:20:49,371 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:20:49,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:20:49,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:20:49,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:20:49,372 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 -> 77fbc3ec0aa1e3a17f6dd73b5c59e0107945f53ef89e3fc3ca652830ca5bf043 [2024-11-07 04:20:49,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:20:49,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:20:49,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:20:49,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:20:49,609 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:20:49,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-40.i [2024-11-07 04:20:50,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:20:50,940 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:20:50,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-40.i [2024-11-07 04:20:50,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df99f8826/dc1bc6f065c74d45badb6db73c703ee2/FLAG539a3d26d [2024-11-07 04:20:50,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df99f8826/dc1bc6f065c74d45badb6db73c703ee2 [2024-11-07 04:20:50,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:20:50,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:20:50,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:20:50,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:20:50,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:20:50,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:20:50" (1/1) ... [2024-11-07 04:20:50,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46eb17a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:50, skipping insertion in model container [2024-11-07 04:20:50,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:20:50" (1/1) ... [2024-11-07 04:20:50,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:20:51,105 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_codestructure_steplocals_file-40.i[917,930] [2024-11-07 04:20:51,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:20:51,160 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:20:51,169 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_codestructure_steplocals_file-40.i[917,930] [2024-11-07 04:20:51,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:20:51,202 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:20:51,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51 WrapperNode [2024-11-07 04:20:51,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:20:51,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:20:51,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:20:51,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:20:51,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51" (1/1) ... [2024-11-07 04:20:51,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51" (1/1) ... [2024-11-07 04:20:51,238 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2024-11-07 04:20:51,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:20:51,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:20:51,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:20:51,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:20:51,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51" (1/1) ... [2024-11-07 04:20:51,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51" (1/1) ... [2024-11-07 04:20:51,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51" (1/1) ... [2024-11-07 04:20:51,271 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 04:20:51,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51" (1/1) ... [2024-11-07 04:20:51,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51" (1/1) ... [2024-11-07 04:20:51,281 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51" (1/1) ... [2024-11-07 04:20:51,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51" (1/1) ... [2024-11-07 04:20:51,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51" (1/1) ... [2024-11-07 04:20:51,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51" (1/1) ... [2024-11-07 04:20:51,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:20:51,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:20:51,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:20:51,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:20:51,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51" (1/1) ... [2024-11-07 04:20:51,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:20:51,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:20:51,331 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 04:20:51,334 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 04:20:51,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:20:51,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:20:51,352 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:20:51,352 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:20:51,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:20:51,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:20:51,427 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:20:51,428 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:20:51,776 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 04:20:51,776 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:20:51,787 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:20:51,787 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:20:51,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:20:51 BoogieIcfgContainer [2024-11-07 04:20:51,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:20:51,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:20:51,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:20:51,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:20:51,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:20:50" (1/3) ... [2024-11-07 04:20:51,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c09dfa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:20:51, skipping insertion in model container [2024-11-07 04:20:51,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:51" (2/3) ... [2024-11-07 04:20:51,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c09dfa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:20:51, skipping insertion in model container [2024-11-07 04:20:51,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:20:51" (3/3) ... [2024-11-07 04:20:51,807 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-40.i [2024-11-07 04:20:51,816 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:20:51,817 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:20:51,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:20:51,860 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;@1d09d53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:20:51,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:20:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 46 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 04:20:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-07 04:20:51,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:20:51,874 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:20:51,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:20:51,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:20:51,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2024668306, now seen corresponding path program 1 times [2024-11-07 04:20:51,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:20:51,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350708813] [2024-11-07 04:20:51,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:20:51,886 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 04:20:51,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:20:51,889 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 04:20:51,890 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 04:20:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:52,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:20:52,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:20:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2024-11-07 04:20:52,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:20:52,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:20:52,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350708813] [2024-11-07 04:20:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350708813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:20:52,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:20:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:20:52,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398334460] [2024-11-07 04:20:52,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:20:52,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:20:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:20:52,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:20:52,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:20:52,190 INFO L87 Difference]: Start difference. First operand has 78 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 46 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-07 04:20:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:20:52,215 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2024-11-07 04:20:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:20:52,216 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 185 [2024-11-07 04:20:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:20:52,221 INFO L225 Difference]: With dead ends: 149 [2024-11-07 04:20:52,221 INFO L226 Difference]: Without dead ends: 74 [2024-11-07 04:20:52,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 184 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 04:20:52,226 INFO L432 NwaCegarLoop]: 110 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, 110 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 04:20:52,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:20:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-07 04:20:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-07 04:20:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 04:20:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 110 transitions. [2024-11-07 04:20:52,257 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 110 transitions. Word has length 185 [2024-11-07 04:20:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:20:52,259 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 110 transitions. [2024-11-07 04:20:52,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-07 04:20:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 110 transitions. [2024-11-07 04:20:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 04:20:52,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:20:52,263 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:20:52,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 04:20:52,464 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 04:20:52,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:20:52,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:20:52,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1430106525, now seen corresponding path program 1 times [2024-11-07 04:20:52,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:20:52,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115457716] [2024-11-07 04:20:52,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:20:52,466 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 04:20:52,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:20:52,467 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 04:20:52,469 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 04:20:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:52,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 04:20:52,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:20:52,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-07 04:20:52,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:20:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-07 04:20:53,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:20:53,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115457716] [2024-11-07 04:20:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115457716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:20:53,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 04:20:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-07 04:20:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411317461] [2024-11-07 04:20:53,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 04:20:53,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 04:20:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:20:53,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 04:20:53,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 04:20:53,118 INFO L87 Difference]: Start difference. First operand 74 states and 110 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-07 04:20:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:20:53,909 INFO L93 Difference]: Finished difference Result 228 states and 330 transitions. [2024-11-07 04:20:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 04:20:53,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 186 [2024-11-07 04:20:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:20:53,912 INFO L225 Difference]: With dead ends: 228 [2024-11-07 04:20:53,912 INFO L226 Difference]: Without dead ends: 157 [2024-11-07 04:20:53,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-07 04:20:53,913 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 153 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 04:20:53,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 308 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 04:20:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-07 04:20:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 76. [2024-11-07 04:20:53,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 04:20:53,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 107 transitions. [2024-11-07 04:20:53,935 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 107 transitions. Word has length 186 [2024-11-07 04:20:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:20:53,936 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 107 transitions. [2024-11-07 04:20:53,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-07 04:20:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 107 transitions. [2024-11-07 04:20:53,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 04:20:53,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:20:53,939 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:20:53,947 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 04:20:54,139 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 04:20:54,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:20:54,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:20:54,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2110164895, now seen corresponding path program 1 times [2024-11-07 04:20:54,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:20:54,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636217202] [2024-11-07 04:20:54,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:20:54,144 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 04:20:54,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:20:54,145 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 04:20:54,146 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 04:20:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:20:54,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 04:20:54,367 INFO L278 TraceCheckSpWp]: Computing forward predicates...