./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.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', 'ba41fad7f72744fe0e42c26f1418f056b21d09a04b2ad100829310a14fd9d787'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.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 ba41fad7f72744fe0e42c26f1418f056b21d09a04b2ad100829310a14fd9d787 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:59:42,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:59:42,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:59:42,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:59:42,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:59:42,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:59:42,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:59:42,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:59:42,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:59:42,526 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:59:42,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:59:42,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:59:42,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:59:42,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:59:42,528 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:59:42,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:59:42,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:59:42,529 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:59:42,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:59:42,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:59:42,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:59:42,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:59:42,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:59:42,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:59:42,530 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:59:42,530 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:59:42,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:59:42,530 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:59:42,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:59:42,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:59:42,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:59:42,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:59:42,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:59:42,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:59:42,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:59:42,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:59:42,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:59:42,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:59:42,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:59:42,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:59:42,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:59:42,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:59:42,531 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 -> ba41fad7f72744fe0e42c26f1418f056b21d09a04b2ad100829310a14fd9d787 [2024-11-07 07:59:42,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:59:42,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:59:42,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:59:42,992 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:59:42,993 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:59:42,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i [2024-11-07 07:59:44,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:59:44,684 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:59:44,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i [2024-11-07 07:59:44,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6196f425/2c6b61936b7f406db39df5287a3a3546/FLAG00ccf23cf [2024-11-07 07:59:44,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6196f425/2c6b61936b7f406db39df5287a3a3546 [2024-11-07 07:59:44,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:59:44,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:59:44,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:59:44,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:59:44,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:59:44,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:59:44" (1/1) ... [2024-11-07 07:59:44,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b97270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:44, skipping insertion in model container [2024-11-07 07:59:44,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:59:44" (1/1) ... [2024-11-07 07:59:44,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:59:44,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i[916,929] [2024-11-07 07:59:45,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:59:45,028 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:59:45,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i[916,929] [2024-11-07 07:59:45,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:59:45,101 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:59:45,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45 WrapperNode [2024-11-07 07:59:45,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:59:45,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:59:45,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:59:45,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:59:45,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45" (1/1) ... [2024-11-07 07:59:45,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45" (1/1) ... [2024-11-07 07:59:45,177 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 214 [2024-11-07 07:59:45,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:59:45,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:59:45,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:59:45,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:59:45,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45" (1/1) ... [2024-11-07 07:59:45,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45" (1/1) ... [2024-11-07 07:59:45,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45" (1/1) ... [2024-11-07 07:59:45,231 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 07:59:45,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45" (1/1) ... [2024-11-07 07:59:45,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45" (1/1) ... [2024-11-07 07:59:45,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45" (1/1) ... [2024-11-07 07:59:45,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45" (1/1) ... [2024-11-07 07:59:45,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45" (1/1) ... [2024-11-07 07:59:45,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45" (1/1) ... [2024-11-07 07:59:45,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:59:45,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:59:45,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:59:45,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:59:45,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45" (1/1) ... [2024-11-07 07:59:45,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:59:45,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:59:45,315 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 07:59:45,319 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 07:59:45,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:59:45,340 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:59:45,340 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:59:45,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:59:45,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:59:45,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:59:45,427 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:59:45,429 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:59:45,948 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-07 07:59:45,949 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:59:45,963 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:59:45,965 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:59:45,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:59:45 BoogieIcfgContainer [2024-11-07 07:59:45,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:59:45,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:59:45,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:59:45,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:59:45,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:59:44" (1/3) ... [2024-11-07 07:59:45,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ae35b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:59:45, skipping insertion in model container [2024-11-07 07:59:45,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:45" (2/3) ... [2024-11-07 07:59:45,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ae35b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:59:45, skipping insertion in model container [2024-11-07 07:59:45,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:59:45" (3/3) ... [2024-11-07 07:59:45,975 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-51.i [2024-11-07 07:59:45,990 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:59:45,991 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:59:46,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:59:46,065 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;@4a7789bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:59:46,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:59:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 07:59:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 07:59:46,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:59:46,089 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:46,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:59:46,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:59:46,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2138227196, now seen corresponding path program 1 times [2024-11-07 07:59:46,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:59:46,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209196092] [2024-11-07 07:59:46,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:59:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:59:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:59:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:59:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:59:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 07:59:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:59:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 07:59:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:59:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:59:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:59:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:59:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:59:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 07:59:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:59:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:59:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:59:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 07:59:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:59:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:59:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:59:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:59:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 07:59:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:59:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 07:59:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:59:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 07:59:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:59:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:59:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:59:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 07:59:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 07:59:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:59:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 07:59:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 07:59:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:59:46,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209196092] [2024-11-07 07:59:46,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209196092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:59:46,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:59:46,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:59:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122726341] [2024-11-07 07:59:46,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:59:46,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:59:46,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:59:46,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:59:46,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:59:46,714 INFO L87 Difference]: Start difference. First operand has 95 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 07:59:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:59:46,758 INFO L93 Difference]: Finished difference Result 187 states and 327 transitions. [2024-11-07 07:59:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:59:46,761 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-07 07:59:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:59:46,770 INFO L225 Difference]: With dead ends: 187 [2024-11-07 07:59:46,772 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 07:59:46,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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 07:59:46,781 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:59:46,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:59:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 07:59:46,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 07:59:46,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 07:59:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2024-11-07 07:59:46,845 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 203 [2024-11-07 07:59:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:59:46,845 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2024-11-07 07:59:46,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 07:59:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2024-11-07 07:59:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 07:59:46,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:59:46,850 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:46,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:59:46,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:59:46,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:59:46,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1522490560, now seen corresponding path program 1 times [2024-11-07 07:59:46,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:59:46,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969341202] [2024-11-07 07:59:46,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:59:46,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:59:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:59:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:59:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:59:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 07:59:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:59:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 07:59:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:59:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:59:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:59:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:59:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:59:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 07:59:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:59:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:59:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:59:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 07:59:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:59:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:59:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:59:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:59:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 07:59:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:59:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 07:59:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:59:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 07:59:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:59:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:59:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:59:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 07:59:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 07:59:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:59:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 07:59:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 07:59:48,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:59:48,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969341202] [2024-11-07 07:59:48,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969341202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:59:48,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876276086] [2024-11-07 07:59:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:59:48,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:59:48,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:59:48,327 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 07:59:48,329 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 07:59:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:48,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:59:48,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:59:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-11-07 07:59:48,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:59:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 07:59:49,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876276086] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:59:49,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:59:49,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 07:59:49,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082258147] [2024-11-07 07:59:49,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:59:49,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 07:59:49,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:59:49,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 07:59:49,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:59:49,322 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-07 07:59:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:59:49,682 INFO L93 Difference]: Finished difference Result 187 states and 288 transitions. [2024-11-07 07:59:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:59:49,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 203 [2024-11-07 07:59:49,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:59:49,686 INFO L225 Difference]: With dead ends: 187 [2024-11-07 07:59:49,686 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 07:59:49,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 466 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:59:49,691 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 130 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:59:49,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 246 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:59:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 07:59:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-07 07:59:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 60 states have internal predecessors, (80), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 07:59:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 144 transitions. [2024-11-07 07:59:49,719 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 144 transitions. Word has length 203 [2024-11-07 07:59:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:59:49,720 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 144 transitions. [2024-11-07 07:59:49,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-07 07:59:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 144 transitions. [2024-11-07 07:59:49,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 07:59:49,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:59:49,727 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:49,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 07:59:49,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:59:49,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:59:49,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:59:49,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1492613058, now seen corresponding path program 1 times [2024-11-07 07:59:49,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:59:49,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776473093] [2024-11-07 07:59:49,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:59:49,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:59:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:59:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:59:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:59:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 07:59:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:59:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 07:59:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:59:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:59:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:59:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:59:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:59:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 07:59:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:59:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:59:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:59:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 07:59:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:59:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:59:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:59:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:59:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 07:59:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:59:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 07:59:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:59:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 07:59:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:59:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:59:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:59:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 07:59:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 07:59:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:59:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 07:59:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 07:59:50,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:59:50,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776473093] [2024-11-07 07:59:50,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776473093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:59:50,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:59:50,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:59:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679979883] [2024-11-07 07:59:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:59:50,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:59:50,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:59:50,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:59:50,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:59:50,895 INFO L87 Difference]: Start difference. First operand 95 states and 144 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 07:59:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:59:51,149 INFO L93 Difference]: Finished difference Result 280 states and 427 transitions. [2024-11-07 07:59:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:59:51,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-11-07 07:59:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:59:51,155 INFO L225 Difference]: With dead ends: 280 [2024-11-07 07:59:51,157 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 07:59:51,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:59:51,160 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 168 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:59:51,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 374 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:59:51,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 07:59:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2024-11-07 07:59:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 116 states have (on average 1.3103448275862069) internal successors, (152), 116 states have internal predecessors, (152), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:59:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 280 transitions. [2024-11-07 07:59:51,210 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 280 transitions. Word has length 203 [2024-11-07 07:59:51,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:59:51,211 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 280 transitions. [2024-11-07 07:59:51,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 07:59:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 280 transitions. [2024-11-07 07:59:51,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 07:59:51,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:59:51,217 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:51,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:59:51,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:59:51,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:59:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash 696376267, now seen corresponding path program 1 times [2024-11-07 07:59:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:59:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992284797] [2024-11-07 07:59:51,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:59:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:59:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:59:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:59:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:59:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 07:59:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:59:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 07:59:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:59:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:59:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:59:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:59:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:59:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 07:59:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:59:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:59:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:59:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 07:59:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:59:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:59:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:59:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:59:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 07:59:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:59:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 07:59:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:59:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 07:59:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:59:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:59:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:59:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 07:59:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 07:59:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:59:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 07:59:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 07:59:52,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:59:52,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992284797] [2024-11-07 07:59:52,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992284797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:59:52,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:59:52,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:59:52,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173505331] [2024-11-07 07:59:52,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:59:52,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:59:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:59:52,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:59:52,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:59:52,002 INFO L87 Difference]: Start difference. First operand 185 states and 280 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 07:59:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:59:52,462 INFO L93 Difference]: Finished difference Result 357 states and 531 transitions. [2024-11-07 07:59:52,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:59:52,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-11-07 07:59:52,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:59:52,466 INFO L225 Difference]: With dead ends: 357 [2024-11-07 07:59:52,466 INFO L226 Difference]: Without dead ends: 265 [2024-11-07 07:59:52,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:59:52,468 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 184 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:59:52,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 319 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 07:59:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-07 07:59:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 196. [2024-11-07 07:59:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 125 states have (on average 1.272) internal successors, (159), 125 states have internal predecessors, (159), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:59:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 287 transitions. [2024-11-07 07:59:52,527 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 287 transitions. Word has length 204 [2024-11-07 07:59:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:59:52,530 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 287 transitions. [2024-11-07 07:59:52,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 07:59:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 287 transitions. [2024-11-07 07:59:52,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 07:59:52,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:59:52,534 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:52,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:59:52,535 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:59:52,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:59:52,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1285433516, now seen corresponding path program 1 times [2024-11-07 07:59:52,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:59:52,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915778371] [2024-11-07 07:59:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:59:52,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:59:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:59:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:59:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:59:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 07:59:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:59:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 07:59:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:59:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:59:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:59:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:59:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:59:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 07:59:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:59:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:59:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:59:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 07:59:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:59:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:59:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:59:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:59:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 07:59:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:59:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 07:59:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:59:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 07:59:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:59:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:59:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:59:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 07:59:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 07:59:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:59:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 07:59:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 07:59:53,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:59:53,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915778371] [2024-11-07 07:59:53,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915778371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:59:53,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762046177] [2024-11-07 07:59:53,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:59:53,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:59:53,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:59:53,911 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 07:59:53,913 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 07:59:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:54,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 07:59:54,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:59:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 841 proven. 66 refuted. 0 times theorem prover too weak. 1077 trivial. 0 not checked. [2024-11-07 07:59:54,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:59:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 07:59:55,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762046177] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:59:55,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:59:55,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2024-11-07 07:59:55,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998231482] [2024-11-07 07:59:55,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:59:55,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 07:59:55,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:59:55,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 07:59:55,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-07 07:59:55,396 INFO L87 Difference]: Start difference. First operand 196 states and 287 transitions. Second operand has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 6 states have call successors, (96), 3 states have call predecessors, (96), 6 states have return successors, (96), 6 states have call predecessors, (96), 6 states have call successors, (96) [2024-11-07 07:59:57,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:59:57,690 INFO L93 Difference]: Finished difference Result 1163 states and 1663 transitions. [2024-11-07 07:59:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-07 07:59:57,691 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 6 states have call successors, (96), 3 states have call predecessors, (96), 6 states have return successors, (96), 6 states have call predecessors, (96), 6 states have call successors, (96) Word has length 204 [2024-11-07 07:59:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:59:57,703 INFO L225 Difference]: With dead ends: 1163 [2024-11-07 07:59:57,703 INFO L226 Difference]: Without dead ends: 970 [2024-11-07 07:59:57,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=525, Invalid=1545, Unknown=0, NotChecked=0, Total=2070 [2024-11-07 07:59:57,707 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1091 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:59:57,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1063 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 07:59:57,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-11-07 07:59:57,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 646. [2024-11-07 07:59:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 413 states have (on average 1.2566585956416465) internal successors, (519), 415 states have internal predecessors, (519), 210 states have call successors, (210), 22 states have call predecessors, (210), 22 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-07 07:59:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 939 transitions. [2024-11-07 07:59:57,858 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 939 transitions. Word has length 204 [2024-11-07 07:59:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:59:57,859 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 939 transitions. [2024-11-07 07:59:57,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 6 states have call successors, (96), 3 states have call predecessors, (96), 6 states have return successors, (96), 6 states have call predecessors, (96), 6 states have call successors, (96) [2024-11-07 07:59:57,859 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 939 transitions. [2024-11-07 07:59:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-07 07:59:57,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:59:57,863 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:57,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 07:59:58,067 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 07:59:58,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:59:58,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:59:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1704215807, now seen corresponding path program 1 times [2024-11-07 07:59:58,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:59:58,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418152793] [2024-11-07 07:59:58,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:59:58,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:59:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:59:58,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202239189] [2024-11-07 07:59:58,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:59:58,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:59:58,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:59:58,301 INFO L229 MonitoredProcess]: Starting monitored process 4 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 07:59:58,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 07:59:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:58,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 07:59:58,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:59:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1258 proven. 93 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2024-11-07 07:59:59,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:00:31,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:00:31,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418152793] [2024-11-07 08:00:31,723 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 08:00:31,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202239189] [2024-11-07 08:00:31,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202239189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:00:31,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:00:31,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-07 08:00:31,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064761377] [2024-11-07 08:00:31,724 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 08:00:31,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 08:00:31,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:00:31,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 08:00:31,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=211, Unknown=29, NotChecked=0, Total=306 [2024-11-07 08:00:31,726 INFO L87 Difference]: Start difference. First operand 646 states and 939 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-07 08:00:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:00:35,471 INFO L93 Difference]: Finished difference Result 2986 states and 4171 transitions. [2024-11-07 08:00:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-07 08:00:35,472 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 205 [2024-11-07 08:00:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:00:35,495 INFO L225 Difference]: With dead ends: 2986 [2024-11-07 08:00:35,495 INFO L226 Difference]: Without dead ends: 2542 [2024-11-07 08:00:35,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=647, Invalid=2179, Unknown=36, NotChecked=0, Total=2862 [2024-11-07 08:00:35,502 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 466 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 179 mSolverCounterUnsat, 98 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 98 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:00:35,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 948 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1309 Invalid, 98 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 08:00:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-11-07 08:00:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 1529. [2024-11-07 08:00:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1026 states have (on average 1.2573099415204678) internal successors, (1290), 1032 states have internal predecessors, (1290), 442 states have call successors, (442), 60 states have call predecessors, (442), 60 states have return successors, (442), 436 states have call predecessors, (442), 442 states have call successors, (442) [2024-11-07 08:00:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2174 transitions. [2024-11-07 08:00:35,727 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2174 transitions. Word has length 205 [2024-11-07 08:00:35,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:00:35,727 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2174 transitions. [2024-11-07 08:00:35,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-07 08:00:35,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2174 transitions. [2024-11-07 08:00:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-07 08:00:35,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:00:35,731 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:00:35,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 08:00:35,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:00:35,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:00:35,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:00:35,933 INFO L85 PathProgramCache]: Analyzing trace with hash 596606783, now seen corresponding path program 1 times [2024-11-07 08:00:35,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:00:35,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360573181] [2024-11-07 08:00:35,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:00:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:00:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:00:36,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580964828] [2024-11-07 08:00:36,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:00:36,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:00:36,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:00:36,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:00:36,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 08:00:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:00:36,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:00:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:00:36,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:00:36,541 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:00:36,542 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:00:36,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 08:00:36,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-07 08:00:36,747 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:00:36,904 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:00:36,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:00:36 BoogieIcfgContainer [2024-11-07 08:00:36,907 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:00:36,908 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:00:36,908 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:00:36,908 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:00:36,910 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:59:45" (3/4) ... [2024-11-07 08:00:36,912 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:00:36,913 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:00:36,914 INFO L158 Benchmark]: Toolchain (without parser) took 52186.32ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 76.0MB in the beginning and 118.0MB in the end (delta: -42.0MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. [2024-11-07 08:00:36,915 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:00:36,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.02ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 58.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:00:36,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.93ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 53.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:00:36,916 INFO L158 Benchmark]: Boogie Preprocessor took 98.66ms. Allocated memory is still 100.7MB. Free memory was 53.6MB in the beginning and 44.4MB in the end (delta: 9.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:00:36,916 INFO L158 Benchmark]: RCFGBuilder took 686.15ms. Allocated memory is still 100.7MB. Free memory was 44.4MB in the beginning and 51.0MB in the end (delta: -6.6MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-11-07 08:00:36,916 INFO L158 Benchmark]: TraceAbstraction took 50938.85ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 50.5MB in the beginning and 118.1MB in the end (delta: -67.6MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2024-11-07 08:00:36,916 INFO L158 Benchmark]: Witness Printer took 5.64ms. Allocated memory is still 226.5MB. Free memory was 118.1MB in the beginning and 118.0MB in the end (delta: 56.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:00:36,918 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 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.02ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 58.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.93ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 53.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.66ms. Allocated memory is still 100.7MB. Free memory was 53.6MB in the beginning and 44.4MB in the end (delta: 9.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 686.15ms. Allocated memory is still 100.7MB. Free memory was 44.4MB in the beginning and 51.0MB in the end (delta: -6.6MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 50938.85ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 50.5MB in the beginning and 118.1MB in the end (delta: -67.6MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. * Witness Printer took 5.64ms. Allocated memory is still 226.5MB. Free memory was 118.1MB in the beginning and 118.0MB in the end (delta: 56.3kB). 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 198, overapproximation of someBinaryDOUBLEComparisonOperation at line 198, overapproximation of someUnaryDOUBLEoperation at line 23. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 0; [L23] float var_1_3 = -0.1; [L24] float var_1_4 = 127.25; [L25] float var_1_5 = 2.75; [L26] signed char var_1_6 = 1; [L27] signed char var_1_7 = -2; [L28] signed char var_1_8 = 25; [L29] signed char var_1_9 = 32; [L30] signed char var_1_11 = 0; [L31] signed long int var_1_12 = 2; [L32] unsigned long int var_1_13 = 256; [L33] unsigned long int var_1_16 = 3775050608; [L34] unsigned char var_1_18 = 16; [L35] unsigned char var_1_19 = 100; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_21 = 0; [L38] unsigned char var_1_22 = 0; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_24 = 32; [L41] unsigned char var_1_25 = 16; [L42] unsigned char var_1_26 = 32; [L43] unsigned char var_1_27 = 0; [L44] unsigned short int var_1_28 = 4; [L45] unsigned short int var_1_29 = 38930; [L46] unsigned short int var_1_30 = 59162; [L47] unsigned short int var_1_31 = 1; [L48] unsigned short int var_1_32 = 30817; [L49] unsigned long int var_1_33 = 50; [L50] double var_1_34 = 50.25; [L51] double var_1_35 = 10000000000000.75; [L52] unsigned long int last_1_var_1_13 = 256; [L53] unsigned short int last_1_var_1_31 = 1; [L54] unsigned long int last_1_var_1_33 = 50; VAL [isInitial=0, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L202] isInitial = 1 [L203] FCALL initially() [L204] int k_loop; [L205] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L205] COND TRUE k_loop < 1 [L206] CALL updateLastVariables() [L193] last_1_var_1_13 = var_1_13 [L194] last_1_var_1_31 = var_1_31 [L195] last_1_var_1_33 = var_1_33 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L206] RET updateLastVariables() [L207] CALL updateVariables() [L141] var_1_3 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L142] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L143] var_1_4 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L144] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L145] var_1_5 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L146] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L147] var_1_6 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L148] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L149] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L149] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L150] var_1_8 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L151] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L152] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L152] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L153] var_1_11 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_11 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L154] RET assume_abort_if_not(var_1_11 >= -126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L155] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L155] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L156] var_1_16 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_16 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L157] RET assume_abort_if_not(var_1_16 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L158] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L158] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L159] var_1_19 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L160] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L161] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L161] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L162] var_1_21 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L163] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L164] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L164] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L165] var_1_24 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L166] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L167] CALL assume_abort_if_not(var_1_24 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L167] RET assume_abort_if_not(var_1_24 <= 64) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L168] var_1_25 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L170] CALL assume_abort_if_not(var_1_25 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L170] RET assume_abort_if_not(var_1_25 <= 63) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L171] var_1_26 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_26 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L172] RET assume_abort_if_not(var_1_26 >= 31) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L173] CALL assume_abort_if_not(var_1_26 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L173] RET assume_abort_if_not(var_1_26 <= 64) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L174] var_1_27 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L175] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L176] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L176] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L177] var_1_29 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L178] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L179] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L179] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L180] var_1_30 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L181] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L182] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L182] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L183] var_1_32 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_32 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L184] RET assume_abort_if_not(var_1_32 >= 16384) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L185] CALL assume_abort_if_not(var_1_32 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L185] RET assume_abort_if_not(var_1_32 <= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L186] var_1_34 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_34 >= -922337.2036854776000e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L187] RET assume_abort_if_not((var_1_34 >= -922337.2036854776000e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L188] var_1_35 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L189] RET assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L190] CALL assume_abort_if_not(var_1_35 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L190] RET assume_abort_if_not(var_1_35 != 0.0F) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=4, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L207] RET updateVariables() [L208] CALL step() [L58] COND FALSE !(last_1_var_1_13 > ((((last_1_var_1_31) > (var_1_16)) ? (last_1_var_1_31) : (var_1_16)))) [L61] var_1_28 = (var_1_25 + var_1_19) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L63] COND FALSE !((- var_1_3) <= (var_1_4 - var_1_5)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L70] COND TRUE var_1_4 != var_1_5 [L71] var_1_7 = var_1_6 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=16, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L75] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L76] COND FALSE !(var_1_18 > ((32u / var_1_16) + 32u)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L79] COND FALSE !(\read(var_1_21)) [L82] var_1_23 = var_1_27 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L84] COND TRUE var_1_5 <= (- ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) [L85] var_1_31 = ((25454 + var_1_32) - var_1_1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L89] unsigned short int stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_2=41838, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L90] COND FALSE !(stepLocal_2 == var_1_11) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L97] COND TRUE (var_1_31 / var_1_16) <= var_1_28 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L98] COND TRUE var_1_28 <= var_1_18 [L99] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L102] unsigned char stepLocal_1 = var_1_20; [L103] unsigned char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_0=0, stepLocal_1=0, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L104] COND FALSE !(var_1_22 || stepLocal_1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_0=0, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L107] COND FALSE !(var_1_20 && stepLocal_0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L111] signed long int stepLocal_4 = (var_1_6 * var_1_1) / -64; [L112] unsigned short int stepLocal_3 = var_1_28; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_4=0, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L113] COND TRUE stepLocal_4 >= var_1_28 [L114] var_1_13 = ((((var_1_28) < (var_1_31)) ? (var_1_28) : (var_1_31))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L120] unsigned long int stepLocal_6 = var_1_16; [L121] signed long int stepLocal_5 = (- var_1_18) / var_1_26; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_5=0, stepLocal_6=-2147483649, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L122] COND FALSE !(var_1_34 < (var_1_5 / var_1_35)) [L137] var_1_33 = var_1_30 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_5=0, stepLocal_6=-2147483649, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L208] RET step() [L209] CALL, EXPR property() [L198-L199] return (((((((((((((- var_1_3) <= (var_1_4 - var_1_5)) ? ((var_1_3 >= (var_1_5 / 255.75f)) ? (var_1_1 == ((signed char) var_1_6)) : (var_1_1 == ((signed char) var_1_6))) : 1) && ((var_1_4 != var_1_5) ? (var_1_7 == ((signed char) var_1_6)) : (var_1_7 == ((signed char) var_1_8)))) && ((var_1_22 || var_1_20) ? (var_1_9 == ((signed char) ((((((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) > (((((-2) < 0 ) ? -(-2) : (-2))))) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (((((-2) < 0 ) ? -(-2) : (-2))))))) > (var_1_6)) ? (((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) > (((((-2) < 0 ) ? -(-2) : (-2))))) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (((((-2) < 0 ) ? -(-2) : (-2))))))) : (var_1_6))))) : ((var_1_20 && var_1_22) ? (var_1_9 == ((signed char) ((((var_1_11) < (var_1_8)) ? (var_1_11) : (var_1_8))))) : 1))) && ((var_1_31 == var_1_11) ? ((! var_1_22) ? (var_1_22 ? (var_1_12 == ((signed long int) var_1_18)) : 1) : 1) : 1)) && ((((var_1_6 * var_1_1) / -64) >= var_1_28) ? (var_1_13 == ((unsigned long int) ((((var_1_28) < (var_1_31)) ? (var_1_28) : (var_1_31))))) : ((50u >= var_1_28) ? (var_1_13 == ((unsigned long int) (var_1_16 - var_1_18))) : 1))) && (var_1_18 == ((unsigned char) var_1_19))) && (((var_1_31 / var_1_16) <= var_1_28) ? ((var_1_28 <= var_1_18) ? (var_1_20 == ((unsigned char) var_1_21)) : 1) : 1)) && ((var_1_18 > ((32u / var_1_16) + 32u)) ? (var_1_22 == ((unsigned char) var_1_21)) : 1)) && (var_1_21 ? (var_1_23 == ((unsigned char) ((var_1_24 + var_1_25) + ((var_1_26 + 32) - var_1_27)))) : (var_1_23 == ((unsigned char) var_1_27)))) && ((last_1_var_1_13 > ((((last_1_var_1_31) > (var_1_16)) ? (last_1_var_1_31) : (var_1_16)))) ? (var_1_28 == ((unsigned short int) (((((var_1_29) > (var_1_30)) ? (var_1_29) : (var_1_30))) - last_1_var_1_33))) : (var_1_28 == ((unsigned short int) (var_1_25 + var_1_19))))) && ((var_1_5 <= (- ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))))) ? (var_1_31 == ((unsigned short int) ((25454 + var_1_32) - var_1_1))) : (var_1_31 == ((unsigned short int) ((((((((var_1_19) < (var_1_23)) ? (var_1_19) : (var_1_23)))) > (var_1_29)) ? (((((var_1_19) < (var_1_23)) ? (var_1_19) : (var_1_23)))) : (var_1_29))))))) && ((var_1_34 < (var_1_5 / var_1_35)) ? ((var_1_16 > ((((64u) < (var_1_28)) ? (64u) : (var_1_28)))) ? (((var_1_4 - var_1_5) <= var_1_3) ? (var_1_33 == ((unsigned long int) (((((8u) < 0 ) ? -(8u) : (8u))) + 25u))) : (var_1_33 == ((unsigned long int) ((((var_1_27) > ((var_1_29 + ((((16u) < (var_1_18)) ? (16u) : (var_1_18)))))) ? (var_1_27) : ((var_1_29 + ((((16u) < (var_1_18)) ? (16u) : (var_1_18)))))))))) : ((((- var_1_18) / var_1_26) < var_1_25) ? (var_1_33 == ((unsigned long int) var_1_30)) : (var_1_33 == ((unsigned long int) var_1_7)))) : (var_1_33 == ((unsigned long int) var_1_30))) ; VAL [\result=0, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L209] RET, EXPR property() [L209] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=-2147483649, var_1_18=256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-512, var_1_26=-225, var_1_27=0, var_1_28=0, var_1_29=-23697, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.7s, OverallIterations: 7, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 98 mSolverCounterUnknown, 2096 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2039 mSDsluCounter, 3096 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2227 mSDsCounter, 923 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2974 IncrementalHoareTripleChecker+Invalid, 3995 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 923 mSolverCounterUnsat, 869 mSDtfsCounter, 2974 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1497 GetRequests, 1380 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 33.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1529occurred in iteration=6, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 1413 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 39.3s InterpolantComputationTime, 2244 NumberOfCodeBlocks, 2244 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2026 ConstructedInterpolants, 11 QuantifiedInterpolants, 7584 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1401 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 19396/19840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 08:00:37,134 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-07 08:00:37,183 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.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 ba41fad7f72744fe0e42c26f1418f056b21d09a04b2ad100829310a14fd9d787 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:00:39,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:00:39,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:00:39,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:00:39,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:00:39,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:00:39,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:00:39,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:00:39,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:00:39,365 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:00:39,366 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:00:39,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:00:39,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:00:39,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:00:39,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:00:39,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:00:39,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:00:39,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:00:39,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:00:39,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:00:39,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:00:39,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:00:39,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:00:39,368 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:00:39,368 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:00:39,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:00:39,368 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:00:39,368 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:00:39,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:00:39,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:00:39,369 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:00:39,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:00:39,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:00:39,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:00:39,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:00:39,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:00:39,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:00:39,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:00:39,370 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:00:39,370 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:00:39,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:00:39,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:00:39,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:00:39,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:00:39,371 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 -> ba41fad7f72744fe0e42c26f1418f056b21d09a04b2ad100829310a14fd9d787 [2024-11-07 08:00:39,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:00:39,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:00:39,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:00:39,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:00:39,676 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:00:39,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i [2024-11-07 08:00:41,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:00:41,222 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:00:41,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i [2024-11-07 08:00:41,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/911df5926/250042424bf44d16ab5392eb1b415254/FLAG84c428046 [2024-11-07 08:00:41,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/911df5926/250042424bf44d16ab5392eb1b415254 [2024-11-07 08:00:41,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:00:41,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:00:41,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:00:41,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:00:41,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:00:41,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:41,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2322dd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41, skipping insertion in model container [2024-11-07 08:00:41,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:41,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:00:41,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i[916,929] [2024-11-07 08:00:41,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:00:41,827 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:00:41,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i[916,929] [2024-11-07 08:00:41,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:00:41,911 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:00:41,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41 WrapperNode [2024-11-07 08:00:41,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:00:41,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:00:41,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:00:41,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:00:41,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:41,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:41,962 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-07 08:00:41,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:00:41,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:00:41,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:00:41,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:00:41,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:41,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:41,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:41,999 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:00:41,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:41,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:42,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:42,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:42,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:42,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:42,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:00:42,034 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:00:42,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:00:42,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:00:42,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41" (1/1) ... [2024-11-07 08:00:42,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:00:42,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:00:42,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:00:42,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:00:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:00:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:00:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:00:42,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:00:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:00:42,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:00:42,203 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:00:42,204 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:00:55,903 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-07 08:00:55,903 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:00:55,916 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:00:55,917 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:00:55,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:00:55 BoogieIcfgContainer [2024-11-07 08:00:55,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:00:55,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:00:55,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:00:55,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:00:55,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:00:41" (1/3) ... [2024-11-07 08:00:55,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7668b701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:00:55, skipping insertion in model container [2024-11-07 08:00:55,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:00:41" (2/3) ... [2024-11-07 08:00:55,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7668b701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:00:55, skipping insertion in model container [2024-11-07 08:00:55,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:00:55" (3/3) ... [2024-11-07 08:00:55,927 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-51.i [2024-11-07 08:00:55,940 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:00:55,940 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:00:55,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:00:56,005 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;@52ed1584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:00:56,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:00:56,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:00:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 08:00:56,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:00:56,032 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:00:56,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:00:56,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:00:56,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2138227196, now seen corresponding path program 1 times [2024-11-07 08:00:56,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:00:56,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474618909] [2024-11-07 08:00:56,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:00:56,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:00:56,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:00:56,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:00:56,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 08:00:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:00:56,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:00:57,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:00:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1490 trivial. 0 not checked. [2024-11-07 08:00:57,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:00:57,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:00:57,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474618909] [2024-11-07 08:00:57,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474618909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:00:57,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:00:57,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:00:57,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839638400] [2024-11-07 08:00:57,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:00:57,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:00:57,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:00:57,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:00:57,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:00:57,084 INFO L87 Difference]: Start difference. First operand has 95 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:00:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:00:57,114 INFO L93 Difference]: Finished difference Result 187 states and 327 transitions. [2024-11-07 08:00:57,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:00:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-07 08:00:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:00:57,126 INFO L225 Difference]: With dead ends: 187 [2024-11-07 08:00:57,127 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 08:00:57,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:00:57,136 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:00:57,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:00:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 08:00:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 08:00:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:00:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2024-11-07 08:00:57,189 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 203 [2024-11-07 08:00:57,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:00:57,189 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2024-11-07 08:00:57,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:00:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2024-11-07 08:00:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 08:00:57,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:00:57,193 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:00:57,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 08:00:57,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:00:57,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:00:57,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:00:57,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1522490560, now seen corresponding path program 1 times [2024-11-07 08:00:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:00:57,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509550278] [2024-11-07 08:00:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:00:57,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:00:57,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:00:57,399 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:00:57,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 08:00:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:00:58,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 08:00:58,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:01:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-11-07 08:01:02,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:01:07,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 08:01:07,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:01:07,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509550278] [2024-11-07 08:01:07,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509550278] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:01:07,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:01:07,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 08:01:07,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562553878] [2024-11-07 08:01:07,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:01:07,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:01:07,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:01:07,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:01:07,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:01:07,476 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50)