./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.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_fillercode_fillercodestructure_filler-ps-ci_file-26.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', 'da4df5dd1fae50c8c45db2adce0db91c4abebe1be827a98b4c34c4c101f7143b'] 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_fillercode_fillercodestructure_filler-ps-ci_file-26.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 da4df5dd1fae50c8c45db2adce0db91c4abebe1be827a98b4c34c4c101f7143b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:50:22,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:50:22,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:50:22,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:50:22,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:50:22,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:50:22,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:50:22,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:50:22,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:50:22,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:50:22,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:50:22,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:50:22,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:50:22,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:50:22,389 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:50:22,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:50:22,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:50:22,389 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:50:22,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:50:22,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:50:22,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:50:22,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:50:22,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:50:22,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:50:22,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:50:22,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:50:22,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:50:22,390 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:50:22,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:50:22,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:50:22,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:50:22,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:50:22,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:50:22,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:50:22,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:50:22,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:50:22,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:50:22,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:50:22,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:50:22,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:50:22,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:50:22,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:50:22,392 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 -> da4df5dd1fae50c8c45db2adce0db91c4abebe1be827a98b4c34c4c101f7143b [2024-11-07 06:50:22,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:50:22,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:50:22,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:50:22,628 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:50:22,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:50:22,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i [2024-11-07 06:50:23,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:50:24,085 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:50:24,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i [2024-11-07 06:50:24,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3bef48e0c/35daa853993c451b8b135dd250e6f333/FLAG1f0d72968 [2024-11-07 06:50:24,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3bef48e0c/35daa853993c451b8b135dd250e6f333 [2024-11-07 06:50:24,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:50:24,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:50:24,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:50:24,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:50:24,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:50:24,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2abe699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24, skipping insertion in model container [2024-11-07 06:50:24,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:50:24,561 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_fillercode_fillercodestructure_filler-ps-ci_file-26.i[919,932] [2024-11-07 06:50:24,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:50:24,636 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:50:24,644 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_fillercode_fillercodestructure_filler-ps-ci_file-26.i[919,932] [2024-11-07 06:50:24,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:50:24,681 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:50:24,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24 WrapperNode [2024-11-07 06:50:24,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:50:24,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:50:24,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:50:24,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:50:24,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,730 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-07 06:50:24,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:50:24,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:50:24,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:50:24,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:50:24,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,760 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 06:50:24,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:50:24,781 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:50:24,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:50:24,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:50:24,782 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24" (1/1) ... [2024-11-07 06:50:24,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:50:24,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:50:24,812 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 06:50:24,816 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 06:50:24,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:50:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:50:24,833 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:50:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:50:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:50:24,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:50:24,892 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:50:24,893 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:50:25,229 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 06:50:25,230 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:50:25,237 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:50:25,238 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:50:25,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:25 BoogieIcfgContainer [2024-11-07 06:50:25,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:50:25,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:50:25,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:50:25,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:50:25,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:50:24" (1/3) ... [2024-11-07 06:50:25,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14692092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:25, skipping insertion in model container [2024-11-07 06:50:25,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:24" (2/3) ... [2024-11-07 06:50:25,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14692092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:25, skipping insertion in model container [2024-11-07 06:50:25,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:25" (3/3) ... [2024-11-07 06:50:25,251 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i [2024-11-07 06:50:25,261 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:50:25,262 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:50:25,329 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:50:25,337 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;@3152760c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:50:25,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:50:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:50:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-07 06:50:25,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:25,353 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:50:25,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:25,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:25,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1006004724, now seen corresponding path program 1 times [2024-11-07 06:50:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:25,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276279620] [2024-11-07 06:50:25,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:25,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:50:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 06:50:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:50:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:50:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:50:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:50:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:50:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:50:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:50:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:50:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:50:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:50:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:50:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:50:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:50:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:50:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:50:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:50:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:50:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:50:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:50:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:50:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:50:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:50:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:50:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 06:50:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:50:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:50:25,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:25,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276279620] [2024-11-07 06:50:25,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276279620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:25,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:25,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:50:25,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223527542] [2024-11-07 06:50:25,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:25,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:50:25,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:25,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:50:25,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:50:25,779 INFO L87 Difference]: Start difference. First operand has 88 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:50:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:25,809 INFO L93 Difference]: Finished difference Result 169 states and 304 transitions. [2024-11-07 06:50:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:50:25,811 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-11-07 06:50:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:25,818 INFO L225 Difference]: With dead ends: 169 [2024-11-07 06:50:25,819 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 06:50:25,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 58 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 06:50:25,826 INFO L432 NwaCegarLoop]: 132 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, 132 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 06:50:25,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:50:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 06:50:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 06:50:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:50:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2024-11-07 06:50:25,896 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 180 [2024-11-07 06:50:25,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:25,897 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2024-11-07 06:50:25,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:50:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2024-11-07 06:50:25,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-07 06:50:25,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:25,904 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:50:25,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:50:25,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:25,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:25,905 INFO L85 PathProgramCache]: Analyzing trace with hash -682939018, now seen corresponding path program 1 times [2024-11-07 06:50:25,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:25,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806450877] [2024-11-07 06:50:25,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:25,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:50:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 06:50:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:50:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:50:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:50:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:50:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:50:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:50:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:50:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:50:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:50:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:50:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:50:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:50:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:50:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:50:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:50:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:50:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:50:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:50:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:50:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:50:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:50:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:50:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:50:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 06:50:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:50:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:50:26,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:26,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806450877] [2024-11-07 06:50:26,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806450877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:26,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:26,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:50:26,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468857853] [2024-11-07 06:50:26,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:26,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:50:26,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:26,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:50:26,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:50:26,553 INFO L87 Difference]: Start difference. First operand 84 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:50:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:26,654 INFO L93 Difference]: Finished difference Result 202 states and 317 transitions. [2024-11-07 06:50:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:50:26,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-11-07 06:50:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:26,656 INFO L225 Difference]: With dead ends: 202 [2024-11-07 06:50:26,657 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 06:50:26,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:50:26,658 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 44 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:26,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 291 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:50:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 06:50:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2024-11-07 06:50:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 06:50:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 181 transitions. [2024-11-07 06:50:26,682 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 181 transitions. Word has length 180 [2024-11-07 06:50:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:26,683 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 181 transitions. [2024-11-07 06:50:26,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:50:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 181 transitions. [2024-11-07 06:50:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-07 06:50:26,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:26,687 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:50:26,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:50:26,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:26,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:26,688 INFO L85 PathProgramCache]: Analyzing trace with hash -266183064, now seen corresponding path program 1 times [2024-11-07 06:50:26,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:26,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876608453] [2024-11-07 06:50:26,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:26,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:50:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 06:50:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:50:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:50:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:50:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:50:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:50:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:50:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:50:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:50:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:50:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:50:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:50:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:50:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:50:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:50:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:50:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:50:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:50:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:50:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:50:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:50:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:50:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:50:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:50:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 06:50:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:50:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:50:27,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:27,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876608453] [2024-11-07 06:50:27,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876608453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:27,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:27,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:50:27,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109288093] [2024-11-07 06:50:27,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:27,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:50:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:27,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:50:27,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:50:27,220 INFO L87 Difference]: Start difference. First operand 118 states and 181 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:50:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:27,562 INFO L93 Difference]: Finished difference Result 355 states and 548 transitions. [2024-11-07 06:50:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:50:27,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2024-11-07 06:50:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:27,566 INFO L225 Difference]: With dead ends: 355 [2024-11-07 06:50:27,566 INFO L226 Difference]: Without dead ends: 240 [2024-11-07 06:50:27,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:50:27,568 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 135 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:27,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 444 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:50:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-07 06:50:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 210. [2024-11-07 06:50:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 147 states have (on average 1.4149659863945578) internal successors, (208), 148 states have internal predecessors, (208), 59 states have call successors, (59), 3 states have call predecessors, (59), 3 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-07 06:50:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 326 transitions. [2024-11-07 06:50:27,594 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 326 transitions. Word has length 181 [2024-11-07 06:50:27,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:27,595 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 326 transitions. [2024-11-07 06:50:27,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:50:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 326 transitions. [2024-11-07 06:50:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-07 06:50:27,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:27,597 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:50:27,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:50:27,597 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:27,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:27,598 INFO L85 PathProgramCache]: Analyzing trace with hash 434881514, now seen corresponding path program 1 times [2024-11-07 06:50:27,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:27,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151790932] [2024-11-07 06:50:27,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:27,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:50:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 06:50:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:50:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:50:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:50:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:50:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:50:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:50:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:50:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:50:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:50:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:50:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:50:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:50:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:50:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:50:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:50:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:50:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:50:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:50:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:50:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:50:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:50:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:50:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:50:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 06:50:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:50:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 06:50:27,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151790932] [2024-11-07 06:50:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151790932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:50:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948157637] [2024-11-07 06:50:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:27,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:50:27,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:50:27,881 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 06:50:27,883 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 06:50:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:50:28,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:50:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 363 proven. 9 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2024-11-07 06:50:28,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:50:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 06:50:28,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948157637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:50:28,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:50:28,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 06:50:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485270530] [2024-11-07 06:50:28,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:50:28,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:50:28,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:28,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:50:28,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:50:28,314 INFO L87 Difference]: Start difference. First operand 210 states and 326 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:50:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:28,605 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2024-11-07 06:50:28,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:50:28,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 181 [2024-11-07 06:50:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:28,608 INFO L225 Difference]: With dead ends: 470 [2024-11-07 06:50:28,608 INFO L226 Difference]: Without dead ends: 263 [2024-11-07 06:50:28,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 414 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:50:28,609 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 85 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:28,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 349 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:50:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-07 06:50:28,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 256. [2024-11-07 06:50:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 167 states have (on average 1.341317365269461) internal successors, (224), 169 states have internal predecessors, (224), 83 states have call successors, (83), 5 states have call predecessors, (83), 5 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-07 06:50:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 390 transitions. [2024-11-07 06:50:28,657 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 390 transitions. Word has length 181 [2024-11-07 06:50:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:28,658 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 390 transitions. [2024-11-07 06:50:28,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:50:28,658 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 390 transitions. [2024-11-07 06:50:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 06:50:28,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:28,659 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:50:28,674 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 06:50:28,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:50:28,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:28,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash 425257297, now seen corresponding path program 1 times [2024-11-07 06:50:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:28,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385086052] [2024-11-07 06:50:28,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:28,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:50:28,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005927318] [2024-11-07 06:50:28,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:28,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:50:28,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:50:28,953 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 06:50:28,955 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 06:50:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:50:29,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:50:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:50:29,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:50:29,615 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:50:29,615 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:50:29,627 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 06:50:29,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:50:29,821 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 06:50:29,945 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:50:29,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:50:29 BoogieIcfgContainer [2024-11-07 06:50:29,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:50:29,953 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:50:29,953 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:50:29,954 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:50:29,954 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:25" (3/4) ... [2024-11-07 06:50:29,956 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:50:29,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:50:29,958 INFO L158 Benchmark]: Toolchain (without parser) took 5542.17ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 93.0MB in the beginning and 47.9MB in the end (delta: 45.1MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2024-11-07 06:50:29,958 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:50:29,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.13ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 77.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:50:29,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.88ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 73.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:50:29,961 INFO L158 Benchmark]: Boogie Preprocessor took 45.72ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 67.2MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:50:29,961 INFO L158 Benchmark]: RCFGBuilder took 456.98ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 41.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 06:50:29,961 INFO L158 Benchmark]: TraceAbstraction took 4711.91ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 40.7MB in the beginning and 48.0MB in the end (delta: -7.3MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2024-11-07 06:50:29,961 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 159.4MB. Free memory was 48.0MB in the beginning and 47.9MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:50:29,962 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.22ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.13ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 77.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.88ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 73.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.72ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 67.2MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 456.98ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 41.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4711.91ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 40.7MB in the beginning and 48.0MB in the end (delta: -7.3MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 159.4MB. Free memory was 48.0MB in the beginning and 47.9MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 205. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 16; [L23] signed long int var_1_4 = -64; [L24] signed char var_1_9 = 10; [L25] unsigned char var_1_10 = 0; [L26] signed char var_1_11 = -1; [L27] unsigned short int var_1_12 = 10000; [L28] float var_1_13 = 5.4; [L29] float var_1_14 = 1.4; [L30] unsigned short int var_1_18 = 32; [L31] double var_1_20 = 1.5; [L32] double var_1_21 = 2.75; [L33] unsigned char var_1_22 = 5; [L34] unsigned short int var_1_23 = 55712; [L35] unsigned char var_1_24 = 5; [L36] signed short int var_1_25 = 10; [L37] float var_1_26 = 64.2; [L38] unsigned short int var_1_27 = 64; [L39] float var_1_33 = 2.5; [L40] unsigned long int var_1_35 = 10; [L41] unsigned long int var_1_37 = 2924974040; [L42] unsigned char var_1_38 = 1; [L43] unsigned char var_1_39 = 0; [L44] unsigned char var_1_40 = 0; [L45] unsigned char var_1_41 = 0; [L46] unsigned char var_1_44 = 0; [L47] unsigned char var_1_45 = 0; [L48] unsigned long int var_1_46 = 32; [L49] unsigned long int var_1_47 = 1000000000; [L50] unsigned long int last_1_var_1_1 = 16; [L51] signed char last_1_var_1_9 = 10; [L52] unsigned short int last_1_var_1_12 = 10000; [L53] double last_1_var_1_20 = 1.5; [L54] unsigned char last_1_var_1_22 = 5; [L55] signed short int last_1_var_1_25 = 10; VAL [isInitial=0, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=-64, var_1_9=10] [L209] isInitial = 1 [L210] FCALL initially() [L211] COND TRUE 1 [L212] CALL updateLastVariables() [L197] last_1_var_1_1 = var_1_1 [L198] last_1_var_1_9 = var_1_9 [L199] last_1_var_1_12 = var_1_12 [L200] last_1_var_1_20 = var_1_20 [L201] last_1_var_1_22 = var_1_22 [L202] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=-64, var_1_9=10] [L212] RET updateLastVariables() [L213] CALL updateVariables() [L152] var_1_4 = __VERIFIER_nondet_long() [L153] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L153] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L154] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L154] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L155] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L155] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L156] var_1_10 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L157] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L158] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L159] var_1_11 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L160] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L161] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L161] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L162] var_1_13 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L163] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L164] var_1_14 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L165] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L166] var_1_18 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L167] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L168] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L168] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L169] var_1_21 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L170] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L171] var_1_23 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L172] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L173] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L173] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L174] var_1_24 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L175] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L176] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L176] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L177] var_1_26 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L178] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L179] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L179] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L180] var_1_37 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_37 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L181] RET assume_abort_if_not(var_1_37 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L182] CALL assume_abort_if_not(var_1_37 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L182] RET assume_abort_if_not(var_1_37 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L183] var_1_39 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L184] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L185] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L185] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L186] var_1_40 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_40 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L187] RET assume_abort_if_not(var_1_40 >= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L188] CALL assume_abort_if_not(var_1_40 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L188] RET assume_abort_if_not(var_1_40 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L189] var_1_44 = __VERIFIER_nondet_uchar() [L190] CALL assume_abort_if_not(var_1_44 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L190] RET assume_abort_if_not(var_1_44 >= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L191] CALL assume_abort_if_not(var_1_44 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L191] RET assume_abort_if_not(var_1_44 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L192] var_1_45 = __VERIFIER_nondet_uchar() [L193] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L193] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L194] CALL assume_abort_if_not(var_1_45 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L194] RET assume_abort_if_not(var_1_45 <= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L213] RET updateVariables() [L214] CALL step() [L59] COND FALSE !(var_1_25 < (var_1_18 - ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L64] COND FALSE !(var_1_25 < var_1_25) [L67] var_1_33 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L69] COND TRUE \read(var_1_10) [L70] var_1_35 = ((((var_1_22) > (var_1_25)) ? (var_1_22) : (var_1_25))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L78] COND TRUE var_1_13 >= (- 255.45f) [L79] var_1_38 = ((! var_1_39) && var_1_40) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L85] COND TRUE ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) < (var_1_12 % var_1_4) [L86] var_1_41 = ((! (var_1_40 && var_1_44)) || (var_1_39 && var_1_45)) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L90] COND TRUE \read(var_1_10) [L91] var_1_46 = (var_1_23 + ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L95] COND TRUE \read(var_1_44) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L96] COND FALSE !(\read(var_1_45)) [L101] var_1_47 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=10] [L104] COND FALSE !(! var_1_10) [L111] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=58] [L113] unsigned char stepLocal_2 = var_1_10; [L114] signed long int stepLocal_1 = last_1_var_1_22; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, stepLocal_2=1, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=58] [L115] COND TRUE ((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || stepLocal_2 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, var_1_10=1, var_1_11=58, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=58] [L116] COND FALSE !(stepLocal_1 >= last_1_var_1_12) [L119] var_1_12 = last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=5, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=58] [L122] unsigned long int stepLocal_5 = last_1_var_1_1; [L123] signed long int stepLocal_4 = var_1_4 + last_1_var_1_9; [L124] unsigned short int stepLocal_3 = var_1_18; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=65537, stepLocal_4=25, stepLocal_5=16, var_1_10=1, var_1_11=58, var_1_12=5, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=58] [L125] COND FALSE !(stepLocal_5 > last_1_var_1_12) [L136] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=65537, stepLocal_4=25, var_1_10=1, var_1_11=58, var_1_12=5, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=-252, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=58] [L138] COND TRUE var_1_11 > (var_1_22 * (var_1_12 + var_1_22)) [L139] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=65537, stepLocal_4=25, var_1_10=1, var_1_11=58, var_1_12=5, var_1_18=65537, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=-252, var_1_23=98304, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=58] [L141] COND TRUE (var_1_20 / var_1_26) > var_1_13 [L142] var_1_25 = ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=65537, stepLocal_4=25, var_1_10=1, var_1_11=58, var_1_12=5, var_1_18=65537, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=-252, var_1_23=98304, var_1_24=-252, var_1_25=4, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=58] [L146] signed long int stepLocal_0 = (var_1_25 + var_1_9) / var_1_4; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_0=4, stepLocal_3=65537, stepLocal_4=25, var_1_10=1, var_1_11=58, var_1_12=5, var_1_18=65537, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=-252, var_1_23=98304, var_1_24=-252, var_1_25=4, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=58] [L147] COND TRUE stepLocal_0 == var_1_25 [L148] var_1_1 = (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=65537, stepLocal_4=25, var_1_10=1, var_1_11=58, var_1_12=5, var_1_18=65537, var_1_1=8, var_1_20=2, var_1_21=2, var_1_22=-252, var_1_23=98304, var_1_24=-252, var_1_25=4, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=58] [L214] RET step() [L215] CALL, EXPR property() [L205-L206] return ((((((((var_1_25 + var_1_9) / var_1_4) == var_1_25) ? (var_1_1 == ((unsigned long int) (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22))) : 1) && ((! var_1_10) ? ((((((last_1_var_1_22) > (last_1_var_1_25)) ? (last_1_var_1_22) : (last_1_var_1_25))) >= last_1_var_1_12) ? (var_1_9 == ((signed char) (-16 + var_1_11))) : (var_1_9 == ((signed char) var_1_11))) : (var_1_9 == ((signed char) var_1_11)))) && ((((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || var_1_10) ? ((last_1_var_1_22 >= last_1_var_1_12) ? (var_1_12 == ((unsigned short int) (((((last_1_var_1_22) < (last_1_var_1_22)) ? (last_1_var_1_22) : (last_1_var_1_22))) + 32))) : (var_1_12 == ((unsigned short int) last_1_var_1_22))) : 1)) && ((var_1_11 > (var_1_22 * (var_1_12 + var_1_22))) ? (var_1_20 == ((double) var_1_21)) : 1)) && ((last_1_var_1_1 > last_1_var_1_12) ? ((last_1_var_1_1 >= (var_1_4 + last_1_var_1_9)) ? ((var_1_18 == (var_1_23 - 8)) ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24)))) && (((var_1_20 / var_1_26) > var_1_13) ? (var_1_25 == ((signed short int) ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))))) : (var_1_25 == ((signed short int) var_1_11))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=5, var_1_18=65537, var_1_1=8, var_1_20=2, var_1_21=2, var_1_22=-252, var_1_23=98304, var_1_24=-252, var_1_25=4, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=58] [L215] RET, EXPR property() [L215] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=5, var_1_18=65537, var_1_1=8, var_1_20=2, var_1_21=2, var_1_22=-252, var_1_23=98304, var_1_24=-252, var_1_25=4, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=58] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=58, var_1_12=5, var_1_18=65537, var_1_1=8, var_1_20=2, var_1_21=2, var_1_22=-252, var_1_23=98304, var_1_24=-252, var_1_25=4, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=58] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 5, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 1216 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 668 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 443 IncrementalHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 548 mSDtfsCounter, 443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 608 GetRequests, 591 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 40 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1267 NumberOfCodeBlocks, 1267 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1078 ConstructedInterpolants, 0 QuantifiedInterpolants, 1805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 438 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 9045/9072 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 06:50:29,991 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_fillercode_fillercodestructure_filler-ps-ci_file-26.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 da4df5dd1fae50c8c45db2adce0db91c4abebe1be827a98b4c34c4c101f7143b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:50:32,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:50:32,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:50:32,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:50:32,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:50:32,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:50:32,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:50:32,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:50:32,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:50:32,396 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:50:32,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:50:32,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:50:32,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:50:32,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:50:32,398 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:50:32,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:50:32,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:50:32,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:50:32,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:50:32,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:50:32,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:50:32,400 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:50:32,400 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:50:32,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:50:32,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:50:32,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:50:32,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:50:32,400 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 -> da4df5dd1fae50c8c45db2adce0db91c4abebe1be827a98b4c34c4c101f7143b [2024-11-07 06:50:32,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:50:32,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:50:32,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:50:32,648 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:50:32,649 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:50:32,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i [2024-11-07 06:50:33,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:50:34,184 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:50:34,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i [2024-11-07 06:50:34,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2abc7cd3f/3376c10ce263446fa5d774b27a30922e/FLAGf0bff3b14 [2024-11-07 06:50:34,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2abc7cd3f/3376c10ce263446fa5d774b27a30922e [2024-11-07 06:50:34,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:50:34,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:50:34,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:50:34,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:50:34,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:50:34,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d148e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34, skipping insertion in model container [2024-11-07 06:50:34,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:50:34,374 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_fillercode_fillercodestructure_filler-ps-ci_file-26.i[919,932] [2024-11-07 06:50:34,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:50:34,471 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:50:34,480 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_fillercode_fillercodestructure_filler-ps-ci_file-26.i[919,932] [2024-11-07 06:50:34,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:50:34,514 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:50:34,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34 WrapperNode [2024-11-07 06:50:34,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:50:34,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:50:34,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:50:34,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:50:34,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,552 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-11-07 06:50:34,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:50:34,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:50:34,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:50:34,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:50:34,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,579 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 06:50:34,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:50:34,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:50:34,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:50:34,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:50:34,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34" (1/1) ... [2024-11-07 06:50:34,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:50:34,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:50:34,627 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 06:50:34,630 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 06:50:34,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:50:34,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:50:34,646 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:50:34,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:50:34,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:50:34,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:50:34,710 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:50:34,712 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:50:47,879 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 06:50:47,879 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:50:47,895 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:50:47,895 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:50:47,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:47 BoogieIcfgContainer [2024-11-07 06:50:47,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:50:47,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:50:47,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:50:47,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:50:47,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:50:34" (1/3) ... [2024-11-07 06:50:47,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c02a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:47, skipping insertion in model container [2024-11-07 06:50:47,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:34" (2/3) ... [2024-11-07 06:50:47,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c02a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:47, skipping insertion in model container [2024-11-07 06:50:47,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:47" (3/3) ... [2024-11-07 06:50:47,903 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i [2024-11-07 06:50:47,913 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:50:47,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:50:47,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:50:47,959 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;@25f7c87b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:50:47,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:50:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:50:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-07 06:50:47,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:47,979 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:50:47,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:47,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:47,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1006004724, now seen corresponding path program 1 times [2024-11-07 06:50:47,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:50:47,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850584950] [2024-11-07 06:50:47,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:47,995 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 06:50:47,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:50:48,001 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 06:50:48,006 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 06:50:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:49,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:50:49,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:50:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:50:49,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:50:49,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:50:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850584950] [2024-11-07 06:50:49,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850584950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:49,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:49,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:50:49,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891541383] [2024-11-07 06:50:49,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:49,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:50:49,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:50:49,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:50:49,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:50:49,079 INFO L87 Difference]: Start difference. First operand has 88 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:50:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:49,115 INFO L93 Difference]: Finished difference Result 169 states and 304 transitions. [2024-11-07 06:50:49,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:50:49,117 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-11-07 06:50:49,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:49,125 INFO L225 Difference]: With dead ends: 169 [2024-11-07 06:50:49,125 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 06:50:49,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 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 06:50:49,133 INFO L432 NwaCegarLoop]: 132 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, 132 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 06:50:49,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:50:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 06:50:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 06:50:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:50:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2024-11-07 06:50:49,179 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 180 [2024-11-07 06:50:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:49,181 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2024-11-07 06:50:49,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:50:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2024-11-07 06:50:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-07 06:50:49,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:49,199 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:50:49,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 06:50:49,399 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 06:50:49,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:49,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash -682939018, now seen corresponding path program 1 times [2024-11-07 06:50:49,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:50:49,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967009942] [2024-11-07 06:50:49,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:49,403 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 06:50:49,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:50:49,405 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 06:50:49,407 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 06:50:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:50,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:50:50,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:50:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 363 proven. 9 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2024-11-07 06:50:51,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:50:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 06:50:53,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:50:53,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967009942] [2024-11-07 06:50:53,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967009942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:50:53,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:50:53,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 06:50:53,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811087317] [2024-11-07 06:50:53,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:50:53,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:50:53,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:50:53,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:50:53,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:50:53,536 INFO L87 Difference]: Start difference. First operand 84 states and 132 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:50:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:57,979 INFO L93 Difference]: Finished difference Result 212 states and 331 transitions. [2024-11-07 06:50:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:50:57,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 180 [2024-11-07 06:50:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:57,982 INFO L225 Difference]: With dead ends: 212 [2024-11-07 06:50:57,983 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 06:50:57,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:50:57,984 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 85 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:57,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 347 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-07 06:50:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 06:50:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2024-11-07 06:50:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 71 states have (on average 1.295774647887324) internal successors, (92), 72 states have internal predecessors, (92), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 06:50:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 196 transitions. [2024-11-07 06:50:57,998 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 196 transitions. Word has length 180 [2024-11-07 06:50:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:57,999 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 196 transitions. [2024-11-07 06:50:57,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:50:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 196 transitions. [2024-11-07 06:50:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-07 06:50:58,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:58,001 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:50:58,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 06:50:58,205 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 06:50:58,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:58,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:58,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1098891473, now seen corresponding path program 1 times [2024-11-07 06:50:58,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:50:58,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179848844] [2024-11-07 06:50:58,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:58,207 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 06:50:58,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:50:58,209 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 06:50:58,211 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 06:50:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:59,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:50:59,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:51:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 403 proven. 69 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2024-11-07 06:51:03,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:51:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:51:05,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:51:05,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179848844] [2024-11-07 06:51:05,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179848844] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 06:51:05,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 06:51:05,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 06:51:05,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670389756] [2024-11-07 06:51:05,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:51:05,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:51:05,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:51:05,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:51:05,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:51:05,136 INFO L87 Difference]: Start difference. First operand 126 states and 196 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:51:10,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:51:14,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:51:18,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:51:22,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:51:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:51:22,720 INFO L93 Difference]: Finished difference Result 248 states and 382 transitions. [2024-11-07 06:51:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:51:22,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2024-11-07 06:51:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:51:22,726 INFO L225 Difference]: With dead ends: 248 [2024-11-07 06:51:22,726 INFO L226 Difference]: Without dead ends: 163 [2024-11-07 06:51:22,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:51:22,734 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 48 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 9 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:51:22,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 387 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 26 Invalid, 4 Unknown, 0 Unchecked, 17.4s Time] [2024-11-07 06:51:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-07 06:51:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2024-11-07 06:51:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 101 states have (on average 1.3267326732673268) internal successors, (134), 103 states have internal predecessors, (134), 55 states have call successors, (55), 3 states have call predecessors, (55), 3 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-07 06:51:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 244 transitions. [2024-11-07 06:51:22,753 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 244 transitions. Word has length 181 [2024-11-07 06:51:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:51:22,753 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 244 transitions. [2024-11-07 06:51:22,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:51:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 244 transitions. [2024-11-07 06:51:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 06:51:22,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:51:22,755 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:51:22,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 06:51:22,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:51:22,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:51:22,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:51:22,957 INFO L85 PathProgramCache]: Analyzing trace with hash -275807281, now seen corresponding path program 1 times [2024-11-07 06:51:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:51:22,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730920822] [2024-11-07 06:51:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:51:22,962 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 06:51:22,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:51:22,964 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:51:22,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 06:51:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:51:23,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:51:23,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:51:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:51:28,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:51:28,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:51:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730920822] [2024-11-07 06:51:28,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730920822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:51:28,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:51:28,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:51:28,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358889101] [2024-11-07 06:51:28,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:51:28,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:51:28,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:51:28,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:51:28,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:51:28,393 INFO L87 Difference]: Start difference. First operand 160 states and 244 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:51:35,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:51:39,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:51:43,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:51:47,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:51:51,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:51:53,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:51:57,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:52:01,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:52:05,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:52:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:52:05,620 INFO L93 Difference]: Finished difference Result 405 states and 613 transitions. [2024-11-07 06:52:05,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:52:05,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2024-11-07 06:52:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:52:05,734 INFO L225 Difference]: With dead ends: 405 [2024-11-07 06:52:05,734 INFO L226 Difference]: Without dead ends: 286 [2024-11-07 06:52:05,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:52:05,735 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 126 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 57 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:52:05,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 441 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 98 Invalid, 8 Unknown, 0 Unchecked, 37.0s Time] [2024-11-07 06:52:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-07 06:52:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 256. [2024-11-07 06:52:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 167 states have (on average 1.341317365269461) internal successors, (224), 169 states have internal predecessors, (224), 83 states have call successors, (83), 5 states have call predecessors, (83), 5 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-07 06:52:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 390 transitions. [2024-11-07 06:52:05,771 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 390 transitions. Word has length 182 [2024-11-07 06:52:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:52:05,772 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 390 transitions. [2024-11-07 06:52:05,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:52:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 390 transitions. [2024-11-07 06:52:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 06:52:05,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:52:05,774 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:52:05,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 06:52:05,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:52:05,975 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:52:05,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:52:05,976 INFO L85 PathProgramCache]: Analyzing trace with hash 425257297, now seen corresponding path program 1 times [2024-11-07 06:52:05,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:52:05,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497182452] [2024-11-07 06:52:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:52:05,977 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 06:52:05,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:52:05,979 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:52:05,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 06:52:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:52:06,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 06:52:06,966 INFO L278 TraceCheckSpWp]: Computing forward predicates...