./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-13.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-13.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', '56eb992ff485ad1132f413888727e18e4f78f27ce239e6605f19595f145f8118'] 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-13.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 56eb992ff485ad1132f413888727e18e4f78f27ce239e6605f19595f145f8118 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:55:07,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:55:07,319 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:55:07,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:55:07,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:55:07,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:55:07,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:55:07,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:55:07,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:55:07,365 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:55:07,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:55:07,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:55:07,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:55:07,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:55:07,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:55:07,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:55:07,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:55:07,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:55:07,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:55:07,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:55:07,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:55:07,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:55:07,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:55:07,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:55:07,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:55:07,368 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:55:07,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:55:07,368 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:55:07,369 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:55:07,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:55:07,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:55:07,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:55:07,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:55:07,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:55:07,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:55:07,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:55:07,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:55:07,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:55:07,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:55:07,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:55:07,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:55:07,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:55:07,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 -> 56eb992ff485ad1132f413888727e18e4f78f27ce239e6605f19595f145f8118 [2024-11-07 07:55:07,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:55:07,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:55:07,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:55:07,691 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:55:07,691 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:55:07,693 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-13.i [2024-11-07 07:55:09,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:55:09,328 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:55:09,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-13.i [2024-11-07 07:55:09,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78d01c516/f708e3a25c514bacb180a5508b3f7d05/FLAGc7c157d25 [2024-11-07 07:55:09,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78d01c516/f708e3a25c514bacb180a5508b3f7d05 [2024-11-07 07:55:09,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:55:09,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:55:09,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:55:09,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:55:09,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:55:09,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:55:09" (1/1) ... [2024-11-07 07:55:09,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29bea44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:09, skipping insertion in model container [2024-11-07 07:55:09,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:55:09" (1/1) ... [2024-11-07 07:55:09,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:55:09,531 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-13.i[916,929] [2024-11-07 07:55:09,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:55:09,628 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:55:09,638 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-13.i[916,929] [2024-11-07 07:55:09,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:55:09,693 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:55:09,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:09 WrapperNode [2024-11-07 07:55:09,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:55:09,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:55:09,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:55:09,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:55:09,702 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:55:09" (1/1) ... [2024-11-07 07:55:09,713 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:55:09" (1/1) ... [2024-11-07 07:55:09,764 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2024-11-07 07:55:09,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:55:09,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:55:09,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:55:09,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:55:09,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:09" (1/1) ... [2024-11-07 07:55:09,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:09" (1/1) ... [2024-11-07 07:55:09,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:09" (1/1) ... [2024-11-07 07:55:09,814 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:55:09,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:09" (1/1) ... [2024-11-07 07:55:09,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:09" (1/1) ... [2024-11-07 07:55:09,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:09" (1/1) ... [2024-11-07 07:55:09,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:09" (1/1) ... [2024-11-07 07:55:09,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:09" (1/1) ... [2024-11-07 07:55:09,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:09" (1/1) ... [2024-11-07 07:55:09,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:55:09,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:55:09,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:55:09,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:55:09,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:09" (1/1) ... [2024-11-07 07:55:09,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:55:09,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:55:09,888 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:55:09,893 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:55:09,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:55:09,915 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:55:09,915 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:55:09,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:55:09,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:55:09,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:55:10,021 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:55:10,023 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:55:10,465 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-07 07:55:10,465 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:55:10,474 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:55:10,475 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:55:10,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:55:10 BoogieIcfgContainer [2024-11-07 07:55:10,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:55:10,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:55:10,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:55:10,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:55:10,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:55:09" (1/3) ... [2024-11-07 07:55:10,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23666126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:55:10, skipping insertion in model container [2024-11-07 07:55:10,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:09" (2/3) ... [2024-11-07 07:55:10,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23666126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:55:10, skipping insertion in model container [2024-11-07 07:55:10,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:55:10" (3/3) ... [2024-11-07 07:55:10,484 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-13.i [2024-11-07 07:55:10,498 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:55:10,498 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:55:10,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:55:10,562 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;@6700745c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:55:10,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:55:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 74 states have (on average 1.445945945945946) internal successors, (107), 75 states have internal predecessors, (107), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 07:55:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 07:55:10,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:10,583 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:10,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:10,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1980312561, now seen corresponding path program 1 times [2024-11-07 07:55:10,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:55:10,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087096051] [2024-11-07 07:55:10,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:10,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:55:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:10,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:55:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:10,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:55:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:10,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:55:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:10,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:55:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:10,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:55:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:10,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:55:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:10,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:55:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:10,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:55:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:10,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:55:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:10,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:55:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:10,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:55:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:10,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:55:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:55:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:55:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 07:55:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:55:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 07:55:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:55:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:55:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:55:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:55:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:55:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:55:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:55:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:55:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 07:55:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:55:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:55:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:55:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 07:55:11,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:55:11,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087096051] [2024-11-07 07:55:11,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087096051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:55:11,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:55:11,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:55:11,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245001416] [2024-11-07 07:55:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:55:11,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:55:11,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:55:11,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:55:11,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:55:11,135 INFO L87 Difference]: Start difference. First operand has 106 states, 74 states have (on average 1.445945945945946) internal successors, (107), 75 states have internal predecessors, (107), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 07:55:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:55:11,172 INFO L93 Difference]: Finished difference Result 207 states and 354 transitions. [2024-11-07 07:55:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:55:11,174 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 192 [2024-11-07 07:55:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:55:11,182 INFO L225 Difference]: With dead ends: 207 [2024-11-07 07:55:11,182 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 07:55:11,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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:55:11,195 INFO L432 NwaCegarLoop]: 158 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, 158 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:55:11,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:55:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 07:55:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-07 07:55:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 07:55:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 154 transitions. [2024-11-07 07:55:11,260 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 154 transitions. Word has length 192 [2024-11-07 07:55:11,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:55:11,260 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 154 transitions. [2024-11-07 07:55:11,261 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 07:55:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 154 transitions. [2024-11-07 07:55:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 07:55:11,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:11,265 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:11,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:55:11,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:11,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash -611332569, now seen corresponding path program 1 times [2024-11-07 07:55:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:55:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223390501] [2024-11-07 07:55:11,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:11,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:55:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:55:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:55:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:55:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:55:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:55:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:55:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:55:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:55:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:55:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:55:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:55:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:55:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:55:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:55:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 07:55:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:55:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 07:55:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:55:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:55:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:55:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:55:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:55:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:55:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:55:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:55:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 07:55:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:55:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:55:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:55:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 07:55:11,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:55:11,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223390501] [2024-11-07 07:55:11,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223390501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:55:11,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:55:11,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:55:11,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029019234] [2024-11-07 07:55:11,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:55:11,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:55:11,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:55:11,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:55:11,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:55:11,900 INFO L87 Difference]: Start difference. First operand 100 states and 154 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 07:55:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:55:12,210 INFO L93 Difference]: Finished difference Result 320 states and 496 transitions. [2024-11-07 07:55:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:55:12,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-11-07 07:55:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:55:12,214 INFO L225 Difference]: With dead ends: 320 [2024-11-07 07:55:12,214 INFO L226 Difference]: Without dead ends: 223 [2024-11-07 07:55:12,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:55:12,218 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 198 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:55:12,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 416 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:55:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-07 07:55:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 211. [2024-11-07 07:55:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 150 states have (on average 1.4333333333333333) internal successors, (215), 150 states have internal predecessors, (215), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 07:55:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 331 transitions. [2024-11-07 07:55:12,286 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 331 transitions. Word has length 192 [2024-11-07 07:55:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:55:12,288 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 331 transitions. [2024-11-07 07:55:12,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 07:55:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 331 transitions. [2024-11-07 07:55:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 07:55:12,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:12,292 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:12,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:55:12,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:12,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:12,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1252909120, now seen corresponding path program 1 times [2024-11-07 07:55:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:55:12,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98138161] [2024-11-07 07:55:12,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:12,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:55:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:55:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:55:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:55:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:55:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:55:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:55:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:55:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:55:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:55:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:55:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:55:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:55:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:55:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:55:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 07:55:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:55:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 07:55:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:55:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:55:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:55:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:55:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:55:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:55:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:55:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:55:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 07:55:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:55:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:55:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:55:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 07:55:12,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:55:12,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98138161] [2024-11-07 07:55:12,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98138161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:55:12,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:55:12,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:55:12,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986889109] [2024-11-07 07:55:12,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:55:12,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:55:12,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:55:12,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:55:12,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:55:12,700 INFO L87 Difference]: Start difference. First operand 211 states and 331 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 07:55:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:55:12,757 INFO L93 Difference]: Finished difference Result 624 states and 981 transitions. [2024-11-07 07:55:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:55:12,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2024-11-07 07:55:12,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:55:12,766 INFO L225 Difference]: With dead ends: 624 [2024-11-07 07:55:12,766 INFO L226 Difference]: Without dead ends: 416 [2024-11-07 07:55:12,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:55:12,768 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 145 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:55:12,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 399 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:55:12,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-07 07:55:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 414. [2024-11-07 07:55:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 293 states have (on average 1.4129692832764504) internal successors, (414), 293 states have internal predecessors, (414), 116 states have call successors, (116), 4 states have call predecessors, (116), 4 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-07 07:55:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 646 transitions. [2024-11-07 07:55:12,857 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 646 transitions. Word has length 193 [2024-11-07 07:55:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:55:12,860 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 646 transitions. [2024-11-07 07:55:12,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 07:55:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 646 transitions. [2024-11-07 07:55:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 07:55:12,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:12,865 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:12,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:55:12,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:12,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:12,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1625390786, now seen corresponding path program 1 times [2024-11-07 07:55:12,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:55:12,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912460828] [2024-11-07 07:55:12,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:12,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:55:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:55:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:55:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:55:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:55:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:55:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:55:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:55:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:55:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:55:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:55:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:55:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:55:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:55:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:55:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 07:55:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:55:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 07:55:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:55:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:55:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:55:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:55:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:55:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:55:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:55:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:55:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 07:55:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:55:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:55:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:55:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 07:55:13,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:55:13,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912460828] [2024-11-07 07:55:13,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912460828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:55:13,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:55:13,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:55:13,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322050634] [2024-11-07 07:55:13,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:55:13,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:55:13,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:55:13,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:55:13,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:55:13,457 INFO L87 Difference]: Start difference. First operand 414 states and 646 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 07:55:13,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:55:13,760 INFO L93 Difference]: Finished difference Result 1435 states and 2242 transitions. [2024-11-07 07:55:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:55:13,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2024-11-07 07:55:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:55:13,772 INFO L225 Difference]: With dead ends: 1435 [2024-11-07 07:55:13,772 INFO L226 Difference]: Without dead ends: 1024 [2024-11-07 07:55:13,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:55:13,778 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 227 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:55:13,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 494 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:55:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2024-11-07 07:55:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1020. [2024-11-07 07:55:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 719 states have (on average 1.376912378303199) internal successors, (990), 719 states have internal predecessors, (990), 290 states have call successors, (290), 10 states have call predecessors, (290), 10 states have return successors, (290), 290 states have call predecessors, (290), 290 states have call successors, (290) [2024-11-07 07:55:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1570 transitions. [2024-11-07 07:55:13,911 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1570 transitions. Word has length 193 [2024-11-07 07:55:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:55:13,912 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1570 transitions. [2024-11-07 07:55:13,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 07:55:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1570 transitions. [2024-11-07 07:55:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 07:55:13,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:13,926 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:13,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:55:13,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:13,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:13,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2020989822, now seen corresponding path program 1 times [2024-11-07 07:55:13,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:55:13,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334965293] [2024-11-07 07:55:13,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:13,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:55:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:55:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:55:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:55:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:55:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:55:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:55:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:55:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:55:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:55:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:55:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:55:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:55:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:55:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:55:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 07:55:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:55:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 07:55:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:55:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:55:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:55:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:55:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:55:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:55:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:55:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:55:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 07:55:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:55:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:55:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:55:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 07:55:14,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:55:14,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334965293] [2024-11-07 07:55:14,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334965293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:55:14,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:55:14,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:55:14,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142143364] [2024-11-07 07:55:14,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:55:14,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:55:14,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:55:14,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:55:14,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:55:14,276 INFO L87 Difference]: Start difference. First operand 1020 states and 1570 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 07:55:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:55:15,005 INFO L93 Difference]: Finished difference Result 2836 states and 4342 transitions. [2024-11-07 07:55:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 07:55:15,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2024-11-07 07:55:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:55:15,023 INFO L225 Difference]: With dead ends: 2836 [2024-11-07 07:55:15,023 INFO L226 Difference]: Without dead ends: 1819 [2024-11-07 07:55:15,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:55:15,033 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 394 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:55:15,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 930 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 07:55:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2024-11-07 07:55:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1739. [2024-11-07 07:55:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1198 states have (on average 1.3564273789649415) internal successors, (1625), 1198 states have internal predecessors, (1625), 522 states have call successors, (522), 18 states have call predecessors, (522), 18 states have return successors, (522), 522 states have call predecessors, (522), 522 states have call successors, (522) [2024-11-07 07:55:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2669 transitions. [2024-11-07 07:55:15,246 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2669 transitions. Word has length 193 [2024-11-07 07:55:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:55:15,247 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2669 transitions. [2024-11-07 07:55:15,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 07:55:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2669 transitions. [2024-11-07 07:55:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 07:55:15,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:15,250 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:15,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:55:15,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:15,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:15,251 INFO L85 PathProgramCache]: Analyzing trace with hash -279832768, now seen corresponding path program 1 times [2024-11-07 07:55:15,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:55:15,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114309266] [2024-11-07 07:55:15,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:15,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:55:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:55:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:55:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:55:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:55:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:55:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:55:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:55:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:55:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:55:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:55:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:55:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:55:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:55:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:55:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 07:55:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:55:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 07:55:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:55:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:55:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:55:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:55:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:55:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:55:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:55:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:55:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 07:55:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:55:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:55:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:55:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 07:55:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:55:16,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114309266] [2024-11-07 07:55:16,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114309266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:55:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245807036] [2024-11-07 07:55:16,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:16,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:55:16,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:55:16,587 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:55:16,589 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:55:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:16,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 07:55:16,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:55:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 571 proven. 57 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2024-11-07 07:55:18,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:55:19,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245807036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:55:19,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:55:19,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2024-11-07 07:55:19,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807295783] [2024-11-07 07:55:19,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:55:19,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 07:55:19,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:55:19,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 07:55:19,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1156, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 07:55:19,759 INFO L87 Difference]: Start difference. First operand 1739 states and 2669 transitions. Second operand has 25 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 5 states have call successors, (58), 4 states have call predecessors, (58), 6 states have return successors, (58), 5 states have call predecessors, (58), 5 states have call successors, (58) [2024-11-07 07:55:33,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:55:33,188 INFO L93 Difference]: Finished difference Result 9565 states and 13972 transitions. [2024-11-07 07:55:33,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2024-11-07 07:55:33,191 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 5 states have call successors, (58), 4 states have call predecessors, (58), 6 states have return successors, (58), 5 states have call predecessors, (58), 5 states have call successors, (58) Word has length 193 [2024-11-07 07:55:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:55:33,246 INFO L225 Difference]: With dead ends: 9565 [2024-11-07 07:55:33,246 INFO L226 Difference]: Without dead ends: 9044 [2024-11-07 07:55:33,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22858 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=7266, Invalid=49140, Unknown=0, NotChecked=0, Total=56406 [2024-11-07 07:55:33,267 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 3304 mSDsluCounter, 5931 mSDsCounter, 0 mSdLazyCounter, 6170 mSolverCounterSat, 1621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3425 SdHoareTripleChecker+Valid, 6489 SdHoareTripleChecker+Invalid, 7791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1621 IncrementalHoareTripleChecker+Valid, 6170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-07 07:55:33,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3425 Valid, 6489 Invalid, 7791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1621 Valid, 6170 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-07 07:55:33,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9044 states. [2024-11-07 07:55:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9044 to 5727. [2024-11-07 07:55:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5727 states, 4051 states have (on average 1.338188101703283) internal successors, (5421), 4088 states have internal predecessors, (5421), 1561 states have call successors, (1561), 114 states have call predecessors, (1561), 114 states have return successors, (1561), 1524 states have call predecessors, (1561), 1561 states have call successors, (1561) [2024-11-07 07:55:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5727 states to 5727 states and 8543 transitions. [2024-11-07 07:55:33,892 INFO L78 Accepts]: Start accepts. Automaton has 5727 states and 8543 transitions. Word has length 193 [2024-11-07 07:55:33,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:55:33,894 INFO L471 AbstractCegarLoop]: Abstraction has 5727 states and 8543 transitions. [2024-11-07 07:55:33,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 5 states have call successors, (58), 4 states have call predecessors, (58), 6 states have return successors, (58), 5 states have call predecessors, (58), 5 states have call successors, (58) [2024-11-07 07:55:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5727 states and 8543 transitions. [2024-11-07 07:55:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 07:55:33,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:33,899 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:33,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 07:55:34,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:55:34,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:34,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:34,101 INFO L85 PathProgramCache]: Analyzing trace with hash -866638782, now seen corresponding path program 1 times [2024-11-07 07:55:34,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:55:34,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886974223] [2024-11-07 07:55:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:34,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:55:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:55:34,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [474566346] [2024-11-07 07:55:34,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:34,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:55:34,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:55:34,293 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:55:34,295 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:55:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:55:34,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:55:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:55:34,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:55:34,692 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:55:34,693 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:55:34,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 07:55:34,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:55:34,899 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:55:35,072 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:55:35,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:55:35 BoogieIcfgContainer [2024-11-07 07:55:35,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:55:35,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:55:35,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:55:35,078 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:55:35,078 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:55:10" (3/4) ... [2024-11-07 07:55:35,080 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:55:35,081 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:55:35,082 INFO L158 Benchmark]: Toolchain (without parser) took 25714.79ms. Allocated memory was 100.7MB in the beginning and 343.9MB in the end (delta: 243.3MB). Free memory was 76.5MB in the beginning and 196.9MB in the end (delta: -120.5MB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. [2024-11-07 07:55:35,082 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:55:35,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.07ms. Allocated memory is still 100.7MB. Free memory was 76.3MB in the beginning and 60.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:55:35,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.63ms. Allocated memory is still 100.7MB. Free memory was 60.2MB in the beginning and 57.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:55:35,082 INFO L158 Benchmark]: Boogie Preprocessor took 87.39ms. Allocated memory is still 100.7MB. Free memory was 56.9MB in the beginning and 53.3MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:55:35,083 INFO L158 Benchmark]: RCFGBuilder took 622.15ms. Allocated memory is still 100.7MB. Free memory was 53.3MB in the beginning and 62.5MB in the end (delta: -9.2MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-07 07:55:35,083 INFO L158 Benchmark]: TraceAbstraction took 24599.64ms. Allocated memory was 100.7MB in the beginning and 343.9MB in the end (delta: 243.3MB). Free memory was 61.6MB in the beginning and 197.0MB in the end (delta: -135.4MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. [2024-11-07 07:55:35,083 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 343.9MB. Free memory was 197.0MB in the beginning and 196.9MB in the end (delta: 78.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:55:35,087 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.31ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.07ms. Allocated memory is still 100.7MB. Free memory was 76.3MB in the beginning and 60.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.63ms. Allocated memory is still 100.7MB. Free memory was 60.2MB in the beginning and 57.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 87.39ms. Allocated memory is still 100.7MB. Free memory was 56.9MB in the beginning and 53.3MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 622.15ms. Allocated memory is still 100.7MB. Free memory was 53.3MB in the beginning and 62.5MB in the end (delta: -9.2MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24599.64ms. Allocated memory was 100.7MB in the beginning and 343.9MB in the end (delta: 243.3MB). Free memory was 61.6MB in the beginning and 197.0MB in the end (delta: -135.4MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 343.9MB. Free memory was 197.0MB in the beginning and 196.9MB in the end (delta: 78.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 208, overapproximation of someBinaryFLOATComparisonOperation at line 208, overapproximation of someBinaryArithmeticDOUBLEoperation at line 118. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed short int var_1_5 = 25; [L24] signed short int var_1_7 = 128; [L25] signed short int var_1_8 = 256; [L26] signed char var_1_9 = -10; [L27] signed char var_1_10 = -16; [L28] signed char var_1_11 = -10; [L29] signed char var_1_12 = -25; [L30] double var_1_13 = 64.875; [L31] double var_1_15 = 1.625; [L32] double var_1_16 = 32.2; [L33] double var_1_17 = 8.6; [L34] double var_1_18 = 10.5; [L35] double var_1_19 = 4.25; [L36] float var_1_20 = 64.5; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] signed long int var_1_25 = -5; [L41] unsigned char var_1_26 = 1; [L42] unsigned char var_1_28 = 0; [L43] signed long int var_1_29 = -10; [L44] float var_1_30 = 10.4; [L45] unsigned long int var_1_31 = 8; [L46] unsigned short int var_1_32 = 47145; [L47] unsigned short int var_1_33 = 17741; [L48] unsigned short int var_1_34 = 2; [L49] unsigned long int var_1_35 = 3282184810; [L50] signed short int last_1_var_1_5 = 25; [L51] signed char last_1_var_1_9 = -10; [L52] double last_1_var_1_13 = 64.875; [L53] signed long int last_1_var_1_25 = -5; [L54] unsigned char last_1_var_1_26 = 1; [L55] signed long int last_1_var_1_29 = -10; [L56] unsigned long int last_1_var_1_31 = 8; VAL [isInitial=0, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=128, var_1_8=256, var_1_9=-10] [L212] isInitial = 1 [L213] FCALL initially() [L214] int k_loop; [L215] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=128, var_1_8=256, var_1_9=-10] [L215] COND TRUE k_loop < 1 [L216] CALL updateLastVariables() [L199] last_1_var_1_5 = var_1_5 [L200] last_1_var_1_9 = var_1_9 [L201] last_1_var_1_13 = var_1_13 [L202] last_1_var_1_25 = var_1_25 [L203] last_1_var_1_26 = var_1_26 [L204] last_1_var_1_29 = var_1_29 [L205] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=128, var_1_8=256, var_1_9=-10] [L216] RET updateLastVariables() [L217] CALL updateVariables() [L151] var_1_7 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L152] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L153] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L153] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L154] var_1_8 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L155] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L156] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L156] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L157] var_1_10 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_10 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L158] RET assume_abort_if_not(var_1_10 >= -31) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L159] CALL assume_abort_if_not(var_1_10 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L159] RET assume_abort_if_not(var_1_10 <= 32) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L160] var_1_11 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_11 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L161] RET assume_abort_if_not(var_1_11 >= -31) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L162] CALL assume_abort_if_not(var_1_11 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L162] RET assume_abort_if_not(var_1_11 <= 31) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L163] var_1_12 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L164] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L165] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L165] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L166] var_1_15 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L167] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L168] var_1_16 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L169] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L170] var_1_17 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L171] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L172] var_1_18 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L173] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L174] var_1_19 = __VERIFIER_nondet_double() [L175] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L175] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L176] var_1_23 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L177] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L178] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L178] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L179] var_1_24 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L180] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L181] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L181] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L182] var_1_28 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L183] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L184] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L184] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L185] var_1_32 = __VERIFIER_nondet_ushort() [L186] CALL assume_abort_if_not(var_1_32 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L186] RET assume_abort_if_not(var_1_32 >= 32767) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L187] CALL assume_abort_if_not(var_1_32 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L187] RET assume_abort_if_not(var_1_32 <= 65535) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L188] var_1_33 = __VERIFIER_nondet_ushort() [L189] CALL assume_abort_if_not(var_1_33 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L189] RET assume_abort_if_not(var_1_33 >= 16383) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L190] CALL assume_abort_if_not(var_1_33 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L190] RET assume_abort_if_not(var_1_33 <= 32767) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L191] var_1_34 = __VERIFIER_nondet_ushort() [L192] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L192] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L193] CALL assume_abort_if_not(var_1_34 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L193] RET assume_abort_if_not(var_1_34 <= 16383) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L194] var_1_35 = __VERIFIER_nondet_ulong() [L195] CALL assume_abort_if_not(var_1_35 >= 3221225471) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L195] RET assume_abort_if_not(var_1_35 >= 3221225471) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L196] CALL assume_abort_if_not(var_1_35 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L196] RET assume_abort_if_not(var_1_35 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L217] RET updateVariables() [L218] CALL step() [L60] unsigned char stepLocal_4 = last_1_var_1_9 >= 4; [L61] signed long int stepLocal_3 = last_1_var_1_9 % 50; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_3=-10, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L62] EXPR last_1_var_1_9 & last_1_var_1_9 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_3=-10, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L62] unsigned char stepLocal_2 = (- var_1_8) <= (last_1_var_1_9 & last_1_var_1_9); [L63] COND FALSE !(last_1_var_1_25 < stepLocal_3) [L78] var_1_26 = var_1_24 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L80] COND FALSE !(9.6 <= last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L85] unsigned char stepLocal_5 = var_1_24; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_5=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L86] COND FALSE !(stepLocal_5 && (var_1_17 != var_1_19)) [L91] var_1_29 = last_1_var_1_5 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L93] unsigned long int stepLocal_0 = last_1_var_1_31; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_0=8, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L94] COND TRUE stepLocal_0 > var_1_7 [L95] var_1_9 = ((var_1_10 + var_1_11) + var_1_12) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L97] COND TRUE (var_1_9 * (var_1_8 - 128)) < var_1_10 [L98] var_1_20 = var_1_15 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L100] COND FALSE !((var_1_9 <= var_1_29) || var_1_22) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L103] unsigned long int stepLocal_9 = (var_1_35 - var_1_32) - ((((var_1_8) < (var_1_33)) ? (var_1_8) : (var_1_33))); [L104] signed long int stepLocal_8 = var_1_29; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_8=25, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L105] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_8=25, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L106] COND FALSE !((var_1_32 - (var_1_33 - var_1_34)) >= stepLocal_8) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L116] signed char stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_1=49, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L117] COND TRUE stepLocal_1 > var_1_31 [L118] var_1_13 = ((var_1_15 - var_1_16) + (((((var_1_17) > (499.25)) ? (var_1_17) : (499.25))) + var_1_18)) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L126] COND TRUE var_1_1 || var_1_22 [L127] var_1_5 = ((((50) < (var_1_9)) ? (50) : (var_1_9))) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] [L133] COND TRUE var_1_1 && ((var_1_8 >= var_1_29) || var_1_26) [L134] var_1_25 = ((((var_1_9) < ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7))))) ? (var_1_9) : ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7)))))) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] [L138] unsigned long int stepLocal_7 = var_1_31; [L139] signed short int stepLocal_6 = var_1_7; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_6=0, stepLocal_7=8, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] [L140] COND FALSE !(stepLocal_7 <= var_1_25) [L147] var_1_30 = var_1_16 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_6=0, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_16=3, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=3, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] [L218] RET step() [L219] CALL, EXPR property() [L208] EXPR (((((((((var_1_9 <= var_1_29) || var_1_22) ? (var_1_1 == ((unsigned char) 0)) : 1) && ((var_1_1 || var_1_22) ? (var_1_5 == ((signed short int) ((((50) < (var_1_9)) ? (50) : (var_1_9))))) : (var_1_22 ? (var_1_5 == ((signed short int) (var_1_7 - var_1_8))) : 1))) && ((last_1_var_1_31 > var_1_7) ? (var_1_9 == ((signed char) ((var_1_10 + var_1_11) + var_1_12))) : 1)) && ((var_1_9 > var_1_31) ? (var_1_13 == ((double) ((var_1_15 - var_1_16) + (((((var_1_17) > (499.25)) ? (var_1_17) : (499.25))) + var_1_18)))) : (var_1_22 ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_19))))) && (((var_1_9 * (var_1_8 - 128)) < var_1_10) ? (var_1_20 == ((float) var_1_15)) : 1)) && ((9.6 <= last_1_var_1_13) ? ((var_1_19 == 4.125) ? (var_1_22 == ((unsigned char) (var_1_23 || var_1_24))) : 1) : 1)) && ((var_1_1 && ((var_1_8 >= var_1_29) || var_1_26)) ? (var_1_25 == ((signed long int) ((((var_1_9) < ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7))))) ? (var_1_9) : ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7)))))))) : (var_1_25 == ((signed long int) (var_1_5 + 16))))) && ((last_1_var_1_25 < (last_1_var_1_9 % 50)) ? (((128u <= last_1_var_1_29) && (last_1_var_1_9 >= 4)) ? ((((- var_1_8) <= (last_1_var_1_9 & last_1_var_1_9)) && last_1_var_1_26) ? (var_1_26 == ((unsigned char) var_1_23)) : ((((((var_1_19) < (1.6)) ? (var_1_19) : (1.6))) < (var_1_16 - var_1_15)) ? (var_1_26 == ((unsigned char) (! var_1_28))) : (var_1_26 == ((unsigned char) var_1_23)))) : (var_1_26 == ((unsigned char) var_1_28))) : (var_1_26 == ((unsigned char) var_1_24))) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_16=3, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=3, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] [L208-L209] return ((((((((((((var_1_9 <= var_1_29) || var_1_22) ? (var_1_1 == ((unsigned char) 0)) : 1) && ((var_1_1 || var_1_22) ? (var_1_5 == ((signed short int) ((((50) < (var_1_9)) ? (50) : (var_1_9))))) : (var_1_22 ? (var_1_5 == ((signed short int) (var_1_7 - var_1_8))) : 1))) && ((last_1_var_1_31 > var_1_7) ? (var_1_9 == ((signed char) ((var_1_10 + var_1_11) + var_1_12))) : 1)) && ((var_1_9 > var_1_31) ? (var_1_13 == ((double) ((var_1_15 - var_1_16) + (((((var_1_17) > (499.25)) ? (var_1_17) : (499.25))) + var_1_18)))) : (var_1_22 ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_19))))) && (((var_1_9 * (var_1_8 - 128)) < var_1_10) ? (var_1_20 == ((float) var_1_15)) : 1)) && ((9.6 <= last_1_var_1_13) ? ((var_1_19 == 4.125) ? (var_1_22 == ((unsigned char) (var_1_23 || var_1_24))) : 1) : 1)) && ((var_1_1 && ((var_1_8 >= var_1_29) || var_1_26)) ? (var_1_25 == ((signed long int) ((((var_1_9) < ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7))))) ? (var_1_9) : ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7)))))))) : (var_1_25 == ((signed long int) (var_1_5 + 16))))) && ((last_1_var_1_25 < (last_1_var_1_9 % 50)) ? (((128u <= last_1_var_1_29) && (last_1_var_1_9 >= 4)) ? ((((- var_1_8) <= (last_1_var_1_9 & last_1_var_1_9)) && last_1_var_1_26) ? (var_1_26 == ((unsigned char) var_1_23)) : ((((((var_1_19) < (1.6)) ? (var_1_19) : (1.6))) < (var_1_16 - var_1_15)) ? (var_1_26 == ((unsigned char) (! var_1_28))) : (var_1_26 == ((unsigned char) var_1_23)))) : (var_1_26 == ((unsigned char) var_1_28))) : (var_1_26 == ((unsigned char) var_1_24)))) && ((var_1_24 && (var_1_17 != var_1_19)) ? ((! last_1_var_1_26) ? (var_1_29 == ((signed long int) -256)) : 1) : (var_1_29 == ((signed long int) last_1_var_1_5)))) && ((var_1_31 <= var_1_25) ? ((var_1_7 > (var_1_12 + var_1_25)) ? (var_1_30 == ((float) (var_1_15 - ((((var_1_16) < (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))) ? (var_1_16) : (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))))) : (var_1_30 == ((float) var_1_18))) : (var_1_30 == ((float) var_1_16)))) && (var_1_1 ? (((var_1_32 - (var_1_33 - var_1_34)) >= var_1_29) ? (var_1_31 == ((unsigned long int) (32u + var_1_33))) : 1) : ((last_1_var_1_31 <= ((var_1_35 - var_1_32) - ((((var_1_8) < (var_1_33)) ? (var_1_8) : (var_1_33))))) ? (var_1_31 == ((unsigned long int) var_1_33)) : (var_1_31 == ((unsigned long int) var_1_8)))) ; [L219] RET, EXPR property() [L219] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_16=3, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=3, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_16=3, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=3, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4389 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4268 mSDsluCounter, 8886 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7118 mSDsCounter, 1807 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6590 IncrementalHoareTripleChecker+Invalid, 8397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1807 mSolverCounterUnsat, 1768 mSDtfsCounter, 6590 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 903 GetRequests, 655 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22860 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5727occurred in iteration=6, InterpolantAutomatonStates: 233, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 3415 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1735 NumberOfCodeBlocks, 1735 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1342 ConstructedInterpolants, 0 QuantifiedInterpolants, 3824 SizeOfPredicates, 8 NumberOfNonLiveVariables, 464 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 11296/11368 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 07:55:35,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-13.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 56eb992ff485ad1132f413888727e18e4f78f27ce239e6605f19595f145f8118 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:55:37,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:55:37,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:55:37,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:55:37,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:55:37,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:55:37,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:55:37,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:55:37,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:55:37,589 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:55:37,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:55:37,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:55:37,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:55:37,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:55:37,591 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:55:37,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:55:37,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:55:37,592 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:55:37,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:55:37,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:55:37,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:55:37,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:55:37,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:55:37,593 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:55:37,593 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:55:37,593 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:55:37,593 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:55:37,593 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:55:37,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:55:37,594 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:55:37,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:55:37,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:55:37,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:55:37,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:55:37,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:55:37,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:55:37,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:55:37,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:55:37,595 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:55:37,595 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:55:37,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:55:37,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:55:37,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:55:37,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:55:37,596 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 -> 56eb992ff485ad1132f413888727e18e4f78f27ce239e6605f19595f145f8118 [2024-11-07 07:55:37,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:55:37,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:55:37,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:55:37,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:55:37,929 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:55:37,931 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-13.i [2024-11-07 07:55:39,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:55:39,545 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:55:39,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-13.i [2024-11-07 07:55:39,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c9468f86/b77f7f5014ec4a479bbd2696b171983a/FLAG747c5f881 [2024-11-07 07:55:39,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c9468f86/b77f7f5014ec4a479bbd2696b171983a [2024-11-07 07:55:39,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:55:39,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:55:39,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:55:39,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:55:39,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:55:39,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:55:39" (1/1) ... [2024-11-07 07:55:39,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52205f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:39, skipping insertion in model container [2024-11-07 07:55:39,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:55:39" (1/1) ... [2024-11-07 07:55:39,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:55:39,769 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-13.i[916,929] [2024-11-07 07:55:39,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:55:39,896 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:55:39,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-13.i[916,929] [2024-11-07 07:55:39,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:55:39,966 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:55:39,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:39 WrapperNode [2024-11-07 07:55:39,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:55:39,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:55:39,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:55:39,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:55:39,977 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:55:39" (1/1) ... [2024-11-07 07:55:39,991 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:55:39" (1/1) ... [2024-11-07 07:55:40,037 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-07 07:55:40,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:55:40,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:55:40,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:55:40,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:55:40,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:39" (1/1) ... [2024-11-07 07:55:40,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:39" (1/1) ... [2024-11-07 07:55:40,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:39" (1/1) ... [2024-11-07 07:55:40,082 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:55:40,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:39" (1/1) ... [2024-11-07 07:55:40,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:39" (1/1) ... [2024-11-07 07:55:40,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:39" (1/1) ... [2024-11-07 07:55:40,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:39" (1/1) ... [2024-11-07 07:55:40,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:39" (1/1) ... [2024-11-07 07:55:40,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:39" (1/1) ... [2024-11-07 07:55:40,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:55:40,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:55:40,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:55:40,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:55:40,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:39" (1/1) ... [2024-11-07 07:55:40,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:55:40,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:55:40,147 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:55:40,151 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:55:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:55:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:55:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:55:40,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:55:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:55:40,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:55:40,284 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:55:40,286 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:55:47,164 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-07 07:55:47,164 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:55:47,176 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:55:47,177 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:55:47,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:55:47 BoogieIcfgContainer [2024-11-07 07:55:47,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:55:47,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:55:47,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:55:47,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:55:47,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:55:39" (1/3) ... [2024-11-07 07:55:47,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f86eb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:55:47, skipping insertion in model container [2024-11-07 07:55:47,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:39" (2/3) ... [2024-11-07 07:55:47,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f86eb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:55:47, skipping insertion in model container [2024-11-07 07:55:47,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:55:47" (3/3) ... [2024-11-07 07:55:47,189 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-13.i [2024-11-07 07:55:47,204 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:55:47,205 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:55:47,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:55:47,263 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;@2b73659f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:55:47,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:55:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 07:55:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-07 07:55:47,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:47,279 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:47,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:47,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:47,284 INFO L85 PathProgramCache]: Analyzing trace with hash 692173019, now seen corresponding path program 1 times [2024-11-07 07:55:47,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:55:47,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184200247] [2024-11-07 07:55:47,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:47,296 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 07:55:47,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:55:47,299 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 07:55:47,301 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 07:55:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:47,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:55:47,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:55:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-07 07:55:48,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:55:48,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:55:48,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184200247] [2024-11-07 07:55:48,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184200247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:55:48,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:55:48,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:55:48,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35465431] [2024-11-07 07:55:48,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:55:48,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:55:48,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:55:48,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:55:48,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:55:48,040 INFO L87 Difference]: Start difference. First operand has 92 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 07:55:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:55:48,076 INFO L93 Difference]: Finished difference Result 181 states and 314 transitions. [2024-11-07 07:55:48,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:55:48,078 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 188 [2024-11-07 07:55:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:55:48,087 INFO L225 Difference]: With dead ends: 181 [2024-11-07 07:55:48,087 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 07:55:48,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 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:55:48,096 INFO L432 NwaCegarLoop]: 141 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, 141 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:55:48,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:55:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 07:55:48,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-07 07:55:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 07:55:48,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 137 transitions. [2024-11-07 07:55:48,149 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 137 transitions. Word has length 188 [2024-11-07 07:55:48,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:55:48,149 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 137 transitions. [2024-11-07 07:55:48,150 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 07:55:48,150 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 137 transitions. [2024-11-07 07:55:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-07 07:55:48,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:48,156 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:48,183 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 07:55:48,357 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 07:55:48,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:48,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash 665708049, now seen corresponding path program 1 times [2024-11-07 07:55:48,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:55:48,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435639943] [2024-11-07 07:55:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:48,360 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 07:55:48,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:55:48,363 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 07:55:48,366 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 07:55:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:48,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 07:55:49,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:55:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 07:55:54,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:55:54,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:55:54,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435639943] [2024-11-07 07:55:54,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435639943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:55:54,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:55:54,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:55:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92753973] [2024-11-07 07:55:54,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:55:54,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:55:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:55:54,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:55:54,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:55:54,482 INFO L87 Difference]: Start difference. First operand 88 states and 137 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 07:55:58,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:56:03,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:56:07,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:56:11,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:56:16,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:56:20,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:56:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:56:20,310 INFO L93 Difference]: Finished difference Result 259 states and 406 transitions. [2024-11-07 07:56:20,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:56:20,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-11-07 07:56:20,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:56:20,377 INFO L225 Difference]: With dead ends: 259 [2024-11-07 07:56:20,377 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 07:56:20,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:56:20,379 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 108 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 59 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2024-11-07 07:56:20,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 351 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 52 Invalid, 4 Unknown, 0 Unchecked, 25.7s Time] [2024-11-07 07:56:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 07:56:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 145. [2024-11-07 07:56:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 07:56:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 226 transitions. [2024-11-07 07:56:20,428 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 226 transitions. Word has length 188 [2024-11-07 07:56:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:56:20,429 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 226 transitions. [2024-11-07 07:56:20,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 07:56:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 226 transitions. [2024-11-07 07:56:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 07:56:20,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:56:20,434 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:20,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 07:56:20,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:56:20,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:56:20,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:56:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1611932071, now seen corresponding path program 1 times [2024-11-07 07:56:20,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:56:20,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70555926] [2024-11-07 07:56:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:56:20,636 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 07:56:20,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:56:20,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:56:20,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 07:56:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:56:21,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 07:56:21,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:56:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 07:56:21,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:56:21,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:56:21,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70555926] [2024-11-07 07:56:21,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70555926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:56:21,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:56:21,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:56:21,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242469725] [2024-11-07 07:56:21,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:56:21,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:56:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:56:21,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:56:21,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:56:21,275 INFO L87 Difference]: Start difference. First operand 145 states and 226 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 07:56:25,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:56:29,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:56:29,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:56:29,578 INFO L93 Difference]: Finished difference Result 312 states and 488 transitions. [2024-11-07 07:56:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:56:29,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 189 [2024-11-07 07:56:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:56:29,654 INFO L225 Difference]: With dead ends: 312 [2024-11-07 07:56:29,655 INFO L226 Difference]: Without dead ends: 227 [2024-11-07 07:56:29,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:56:29,656 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 128 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:56:29,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 360 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2024-11-07 07:56:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-07 07:56:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2024-11-07 07:56:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 134 states have (on average 1.3208955223880596) internal successors, (177), 134 states have internal predecessors, (177), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-07 07:56:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 351 transitions. [2024-11-07 07:56:29,689 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 351 transitions. Word has length 189 [2024-11-07 07:56:29,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:56:29,690 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 351 transitions. [2024-11-07 07:56:29,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 07:56:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 351 transitions. [2024-11-07 07:56:29,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 07:56:29,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:56:29,698 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:29,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0