./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.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', '90d2ecb269ea751b29d0bf6d98b8e81014506e0b0b654fb9f2949f1dc1fe64a3'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.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 90d2ecb269ea751b29d0bf6d98b8e81014506e0b0b654fb9f2949f1dc1fe64a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:56:48,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:56:48,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:56:48,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:56:48,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:56:48,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:56:48,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:56:48,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:56:48,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:56:48,953 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:56:48,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:56:48,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:56:48,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:56:48,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:56:48,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:56:48,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:56:48,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:56:48,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:56:48,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:56:48,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:56:48,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:56:48,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:56:48,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:56:48,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:56:48,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:56:48,955 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:56:48,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:56:48,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:56:48,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:56:48,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:56:48,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:56:48,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:56:48,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:56:48,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:56:48,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:56:48,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:56:48,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:56:48,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:56:48,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:56:48,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:56:48,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:56:48,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:56:48,956 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 -> 90d2ecb269ea751b29d0bf6d98b8e81014506e0b0b654fb9f2949f1dc1fe64a3 [2024-11-07 06:56:49,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:56:49,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:56:49,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:56:49,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:56:49,247 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:56:49,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2024-11-07 06:56:50,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:56:50,894 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:56:50,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2024-11-07 06:56:50,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8de7e3e15/fb7141210e974c1f82236fdcd491312f/FLAG2b28b8cb6 [2024-11-07 06:56:51,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8de7e3e15/fb7141210e974c1f82236fdcd491312f [2024-11-07 06:56:51,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:56:51,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:56:51,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:56:51,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:56:51,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:56:51,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25efdc2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51, skipping insertion in model container [2024-11-07 06:56:51,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:56:51,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i[919,932] [2024-11-07 06:56:51,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:56:51,437 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:56:51,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i[919,932] [2024-11-07 06:56:51,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:56:51,484 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:56:51,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51 WrapperNode [2024-11-07 06:56:51,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:56:51,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:56:51,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:56:51,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:56:51,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,527 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 234 [2024-11-07 06:56:51,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:56:51,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:56:51,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:56:51,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:56:51,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,563 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 06:56:51,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:56:51,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:56:51,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:56:51,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:56:51,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51" (1/1) ... [2024-11-07 06:56:51,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:56:51,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:56:51,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 06:56:51,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 06:56:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:56:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:56:51,653 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:56:51,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:56:51,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:56:51,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:56:51,732 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:56:51,733 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:56:52,139 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-07 06:56:52,139 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:56:52,147 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:56:52,147 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:56:52,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:56:52 BoogieIcfgContainer [2024-11-07 06:56:52,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:56:52,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:56:52,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:56:52,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:56:52,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:56:51" (1/3) ... [2024-11-07 06:56:52,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c6bb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:56:52, skipping insertion in model container [2024-11-07 06:56:52,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:51" (2/3) ... [2024-11-07 06:56:52,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c6bb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:56:52, skipping insertion in model container [2024-11-07 06:56:52,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:56:52" (3/3) ... [2024-11-07 06:56:52,155 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2024-11-07 06:56:52,166 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:56:52,167 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:56:52,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:56:52,221 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;@49b5eff1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:56:52,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:56:52,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:56:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 06:56:52,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:52,242 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:56:52,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:52,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:52,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1811903678, now seen corresponding path program 1 times [2024-11-07 06:56:52,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:52,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155744926] [2024-11-07 06:56:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:52,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:56:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:56:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:56:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:56:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:56:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:56:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:56:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:56:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:56:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:56:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:56:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:56:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:56:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:56:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:56:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:56:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:56:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:56:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:56:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:56:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:56:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:56:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:56:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:56:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:56:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:56:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 06:56:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:56:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:56:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 06:56:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 06:56:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:56:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:56:52,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:52,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155744926] [2024-11-07 06:56:52,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155744926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:56:52,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:56:52,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:56:52,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435106684] [2024-11-07 06:56:52,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:56:52,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:56:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:52,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:56:52,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:56:52,619 INFO L87 Difference]: Start difference. First operand has 102 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:56:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:52,653 INFO L93 Difference]: Finished difference Result 197 states and 352 transitions. [2024-11-07 06:56:52,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:56:52,655 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-07 06:56:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:52,661 INFO L225 Difference]: With dead ends: 197 [2024-11-07 06:56:52,661 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 06:56:52,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:56:52,667 INFO L432 NwaCegarLoop]: 155 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, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:52,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:56:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 06:56:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-07 06:56:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:56:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 155 transitions. [2024-11-07 06:56:52,713 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 155 transitions. Word has length 203 [2024-11-07 06:56:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:52,714 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 155 transitions. [2024-11-07 06:56:52,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:56:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2024-11-07 06:56:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 06:56:52,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:52,719 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:56:52,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:56:52,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:52,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:52,721 INFO L85 PathProgramCache]: Analyzing trace with hash -523044284, now seen corresponding path program 1 times [2024-11-07 06:56:52,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:52,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841654157] [2024-11-07 06:56:52,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:52,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:56:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:56:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:56:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:56:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:56:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:56:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:56:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:56:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:56:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:56:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:56:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:56:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:56:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:56:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:56:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:56:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:56:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:56:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:56:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:56:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:56:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:56:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:56:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:56:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:56:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:56:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 06:56:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:56:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:56:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 06:56:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 06:56:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:56:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:56:53,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:53,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841654157] [2024-11-07 06:56:53,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841654157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:56:53,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:56:53,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 06:56:53,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499705688] [2024-11-07 06:56:53,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:56:53,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:56:53,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:53,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:56:53,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:56:53,464 INFO L87 Difference]: Start difference. First operand 98 states and 155 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:56:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:53,784 INFO L93 Difference]: Finished difference Result 295 states and 466 transitions. [2024-11-07 06:56:53,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 06:56:53,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-07 06:56:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:53,789 INFO L225 Difference]: With dead ends: 295 [2024-11-07 06:56:53,790 INFO L226 Difference]: Without dead ends: 200 [2024-11-07 06:56:53,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:56:53,792 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 239 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:53,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 519 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:56:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-07 06:56:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 190. [2024-11-07 06:56:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 123 states have internal predecessors, (175), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:56:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 303 transitions. [2024-11-07 06:56:53,835 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 303 transitions. Word has length 203 [2024-11-07 06:56:53,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:53,836 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 303 transitions. [2024-11-07 06:56:53,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:56:53,836 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 303 transitions. [2024-11-07 06:56:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 06:56:53,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:53,840 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:56:53,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:56:53,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:53,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:53,841 INFO L85 PathProgramCache]: Analyzing trace with hash -521197242, now seen corresponding path program 1 times [2024-11-07 06:56:53,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:53,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082289796] [2024-11-07 06:56:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:53,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:56:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:56:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:56:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:56:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:56:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:56:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:56:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:56:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:56:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:56:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:56:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:56:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:56:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:56:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:56:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:56:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:56:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:56:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:56:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:56:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:56:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:56:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:56:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:56:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:56:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:56:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 06:56:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:56:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:56:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 06:56:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 06:56:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:56:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:56:54,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:54,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082289796] [2024-11-07 06:56:54,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082289796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:56:54,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:56:54,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:56:54,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176411151] [2024-11-07 06:56:54,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:56:54,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:56:54,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:54,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:56:54,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:56:54,023 INFO L87 Difference]: Start difference. First operand 190 states and 303 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:56:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:54,077 INFO L93 Difference]: Finished difference Result 371 states and 595 transitions. [2024-11-07 06:56:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:56:54,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-11-07 06:56:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:54,083 INFO L225 Difference]: With dead ends: 371 [2024-11-07 06:56:54,085 INFO L226 Difference]: Without dead ends: 184 [2024-11-07 06:56:54,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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 06:56:54,086 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:54,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:56:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-07 06:56:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 97. [2024-11-07 06:56:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:56:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2024-11-07 06:56:54,108 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 203 [2024-11-07 06:56:54,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:54,110 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2024-11-07 06:56:54,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:56:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2024-11-07 06:56:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 06:56:54,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:54,114 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:56:54,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:56:54,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:54,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:54,115 INFO L85 PathProgramCache]: Analyzing trace with hash -286622908, now seen corresponding path program 1 times [2024-11-07 06:56:54,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:54,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393737183] [2024-11-07 06:56:54,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:54,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:56:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:56:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:56:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:56:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:56:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:56:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:56:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:56:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:56:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:56:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:56:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:56:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:56:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:56:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:56:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:56:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:56:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:56:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:56:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:56:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:56:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:56:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:56:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:56:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:56:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:56:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 06:56:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:56:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:56:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 06:56:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 06:56:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:56:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 06:56:54,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:54,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393737183] [2024-11-07 06:56:54,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393737183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:56:54,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996242178] [2024-11-07 06:56:54,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:54,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:56:54,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:56:54,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:56:54,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 06:56:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:54,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 06:56:54,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:56:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-11-07 06:56:55,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:56:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 117 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-11-07 06:56:55,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996242178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:56:55,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:56:55,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2024-11-07 06:56:55,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636971763] [2024-11-07 06:56:55,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:56:55,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 06:56:55,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:55,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 06:56:55,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-07 06:56:55,805 INFO L87 Difference]: Start difference. First operand 97 states and 152 transitions. Second operand has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2024-11-07 06:56:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:56,441 INFO L93 Difference]: Finished difference Result 211 states and 318 transitions. [2024-11-07 06:56:56,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 06:56:56,442 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) Word has length 203 [2024-11-07 06:56:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:56,444 INFO L225 Difference]: With dead ends: 211 [2024-11-07 06:56:56,444 INFO L226 Difference]: Without dead ends: 117 [2024-11-07 06:56:56,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2024-11-07 06:56:56,446 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 266 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:56,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 296 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:56:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-07 06:56:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2024-11-07 06:56:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:56:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-11-07 06:56:56,459 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 203 [2024-11-07 06:56:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:56,459 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-11-07 06:56:56,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2024-11-07 06:56:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-11-07 06:56:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-07 06:56:56,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:56,462 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:56:56,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 06:56:56,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:56:56,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:56,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:56,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2128797360, now seen corresponding path program 1 times [2024-11-07 06:56:56,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:56,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997303416] [2024-11-07 06:56:56,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:56,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:56:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:56:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:56:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:56:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:56:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:56:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:56:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:56:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:56:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:56:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:56:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:56:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:56:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:56:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:56:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:56:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:56:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:56:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:56:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:56:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:56:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:56:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:56:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:56:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:56:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:56:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 06:56:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:56:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:56:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 06:56:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 06:56:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:56:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:56:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:56,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997303416] [2024-11-07 06:56:56,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997303416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:56:56,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:56:56,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:56:56,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988791313] [2024-11-07 06:56:56,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:56:56,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:56:56,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:56,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:56:56,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:56:56,977 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:56:57,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:57,009 INFO L93 Difference]: Finished difference Result 312 states and 452 transitions. [2024-11-07 06:56:57,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:56:57,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-11-07 06:56:57,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:57,012 INFO L225 Difference]: With dead ends: 312 [2024-11-07 06:56:57,013 INFO L226 Difference]: Without dead ends: 206 [2024-11-07 06:56:57,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 06:56:57,014 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 71 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:57,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 282 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:56:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-07 06:56:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2024-11-07 06:56:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 120 states have (on average 1.2333333333333334) internal successors, (148), 120 states have internal predecessors, (148), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:56:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 276 transitions. [2024-11-07 06:56:57,045 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 276 transitions. Word has length 205 [2024-11-07 06:56:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:57,046 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 276 transitions. [2024-11-07 06:56:57,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:56:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 276 transitions. [2024-11-07 06:56:57,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 06:56:57,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:57,048 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:56:57,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:56:57,048 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:57,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:57,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1915698294, now seen corresponding path program 1 times [2024-11-07 06:56:57,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:57,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764640897] [2024-11-07 06:56:57,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:57,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:56:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:56:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:56:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:56:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:56:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:56:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:56:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:56:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:56:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:56:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:56:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:56:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:56:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:56:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:56:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:56:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:56:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:56:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:56:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:56:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:56:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:56:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:56:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:56:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:56:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:56:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:57,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 06:56:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:56:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:58,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:56:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:58,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 06:56:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:58,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 06:56:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:58,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:56:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 06:56:58,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:58,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764640897] [2024-11-07 06:56:58,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764640897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:56:58,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260603163] [2024-11-07 06:56:58,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:58,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:56:58,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:56:58,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:56:58,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 06:56:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:58,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 06:56:58,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:56:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1406 proven. 87 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2024-11-07 06:56:58,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:57:00,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260603163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:57:00,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:57:00,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-11-07 06:57:00,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179256158] [2024-11-07 06:57:00,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:57:00,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 06:57:00,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:57:00,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 06:57:00,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-07 06:57:00,014 INFO L87 Difference]: Start difference. First operand 193 states and 276 transitions. Second operand has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 7 states have call successors, (64), 4 states have call predecessors, (64), 6 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) [2024-11-07 06:57:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:00,781 INFO L93 Difference]: Finished difference Result 357 states and 490 transitions. [2024-11-07 06:57:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 06:57:00,782 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 7 states have call successors, (64), 4 states have call predecessors, (64), 6 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) Word has length 206 [2024-11-07 06:57:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:00,784 INFO L225 Difference]: With dead ends: 357 [2024-11-07 06:57:00,784 INFO L226 Difference]: Without dead ends: 251 [2024-11-07 06:57:00,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 06:57:00,785 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 293 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:00,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 491 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:57:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-07 06:57:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 217. [2024-11-07 06:57:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 138 states have (on average 1.1956521739130435) internal successors, (165), 138 states have internal predecessors, (165), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:57:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 293 transitions. [2024-11-07 06:57:00,801 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 293 transitions. Word has length 206 [2024-11-07 06:57:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:00,801 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 293 transitions. [2024-11-07 06:57:00,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 7 states have call successors, (64), 4 states have call predecessors, (64), 6 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) [2024-11-07 06:57:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 293 transitions. [2024-11-07 06:57:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 06:57:00,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:00,803 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:00,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 06:57:01,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:57:01,006 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:01,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:01,007 INFO L85 PathProgramCache]: Analyzing trace with hash -635834616, now seen corresponding path program 1 times [2024-11-07 06:57:01,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:01,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287112454] [2024-11-07 06:57:01,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:01,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:57:01,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1750675600] [2024-11-07 06:57:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:01,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:57:01,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:57:01,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:57:01,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 06:57:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:57:01,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:57:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:57:01,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:57:01,474 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:57:01,475 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:57:01,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 06:57:01,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:57:01,681 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:01,808 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:57:01,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:57:01 BoogieIcfgContainer [2024-11-07 06:57:01,813 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:57:01,814 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:57:01,814 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:57:01,814 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:57:01,815 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:56:52" (3/4) ... [2024-11-07 06:57:01,817 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:57:01,817 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:57:01,818 INFO L158 Benchmark]: Toolchain (without parser) took 10580.85ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 116.0MB in the beginning and 169.4MB in the end (delta: -53.5MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2024-11-07 06:57:01,818 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:57:01,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.08ms. Allocated memory is still 142.6MB. Free memory was 115.8MB in the beginning and 100.3MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:57:01,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.00ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 95.8MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:57:01,818 INFO L158 Benchmark]: Boogie Preprocessor took 63.78ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 90.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:57:01,818 INFO L158 Benchmark]: RCFGBuilder took 555.04ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 60.3MB in the end (delta: 29.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-07 06:57:01,819 INFO L158 Benchmark]: TraceAbstraction took 9663.61ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 59.8MB in the beginning and 169.5MB in the end (delta: -109.7MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-07 06:57:01,819 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 276.8MB. Free memory was 169.5MB in the beginning and 169.4MB in the end (delta: 103.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:57:01,820 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.40ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.08ms. Allocated memory is still 142.6MB. Free memory was 115.8MB in the beginning and 100.3MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.00ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 95.8MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.78ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 90.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 555.04ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 60.3MB in the end (delta: 29.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9663.61ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 59.8MB in the beginning and 169.5MB in the end (delta: -109.7MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 276.8MB. Free memory was 169.5MB in the beginning and 169.4MB in the end (delta: 103.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 198. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] float var_1_2 = 255.5; [L24] float var_1_3 = 99.8; [L25] signed char var_1_4 = -25; [L26] float var_1_6 = 255.25; [L27] unsigned short int var_1_7 = 16; [L28] signed char var_1_8 = -10; [L29] signed char var_1_9 = -8; [L30] unsigned short int var_1_10 = 8; [L31] unsigned short int var_1_11 = 10000; [L32] unsigned short int var_1_12 = 5; [L33] signed short int var_1_13 = 200; [L34] unsigned char var_1_15 = 0; [L35] unsigned short int var_1_16 = 35895; [L36] unsigned short int var_1_17 = 18336; [L37] unsigned char var_1_18 = 0; [L38] signed long int var_1_19 = -50; [L39] unsigned char var_1_20 = 10; [L40] unsigned char var_1_22 = 100; [L41] unsigned char var_1_23 = 16; [L42] signed long int var_1_24 = -256; [L43] unsigned char var_1_25 = 1; [L44] unsigned char var_1_30 = 25; [L45] signed char var_1_32 = 1; [L46] unsigned char var_1_33 = 200; [L47] unsigned char var_1_34 = 64; [L48] unsigned char var_1_35 = 64; [L49] unsigned char var_1_36 = 8; [L50] unsigned short int var_1_37 = 500; [L51] unsigned char var_1_38 = 32; [L52] unsigned short int var_1_39 = 25; [L53] signed char last_1_var_1_8 = -10; [L54] unsigned char last_1_var_1_15 = 0; [L55] signed long int last_1_var_1_19 = -50; VAL [isInitial=0, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_2=511/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L193] last_1_var_1_8 = var_1_8 [L194] last_1_var_1_15 = var_1_15 [L195] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_2=511/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L205] RET updateLastVariables() [L206] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L143] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L144] var_1_3 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L145] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L146] var_1_4 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L147] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L149] var_1_6 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L150] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L151] var_1_7 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_8=-10, var_1_9=-8] [L152] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_8=-10, var_1_9=-8] [L153] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=-8] [L153] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=-8] [L154] var_1_9 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L155] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L156] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L156] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L157] var_1_11 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_11 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L158] RET assume_abort_if_not(var_1_11 >= 8191) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L159] CALL assume_abort_if_not(var_1_11 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L159] RET assume_abort_if_not(var_1_11 <= 16384) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L160] var_1_12 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L161] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L162] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L162] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L163] var_1_16 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L164] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L165] CALL assume_abort_if_not(var_1_16 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L165] RET assume_abort_if_not(var_1_16 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L166] var_1_17 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_17 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L167] RET assume_abort_if_not(var_1_17 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L168] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L168] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L169] var_1_18 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L170] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L171] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L171] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L172] var_1_22 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L173] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L174] CALL assume_abort_if_not(var_1_22 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L174] RET assume_abort_if_not(var_1_22 <= 254) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L175] var_1_32 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_32 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L176] RET assume_abort_if_not(var_1_32 >= -128) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L177] CALL assume_abort_if_not(var_1_32 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L177] RET assume_abort_if_not(var_1_32 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L178] CALL assume_abort_if_not(var_1_32 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L178] RET assume_abort_if_not(var_1_32 != 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L179] var_1_33 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_33 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L180] RET assume_abort_if_not(var_1_33 >= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L181] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L181] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L182] var_1_34 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L183] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L184] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L184] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L185] var_1_35 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_35 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L186] RET assume_abort_if_not(var_1_35 >= 63) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L187] CALL assume_abort_if_not(var_1_35 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L187] RET assume_abort_if_not(var_1_35 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L188] var_1_36 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L189] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L190] CALL assume_abort_if_not(var_1_36 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L190] RET assume_abort_if_not(var_1_36 <= 63) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L206] RET updateVariables() [L207] CALL step() [L59] COND FALSE !(var_1_7 <= -1) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L62] var_1_23 = var_1_22 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L63] EXPR var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L63] EXPR var_1_8 & (var_1_22 >> var_1_4) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L63] COND TRUE var_1_13 >= (var_1_8 & (var_1_22 >> var_1_4)) [L64] var_1_24 = (var_1_22 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L70] COND TRUE var_1_16 >= (-128 & var_1_11) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L71] COND FALSE !((((((var_1_3) > (var_1_3)) ? (var_1_3) : (var_1_3))) <= var_1_3) && var_1_18) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L77] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L80] COND TRUE ! var_1_15 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L81] COND TRUE (var_1_9 % var_1_32) <= var_1_11 [L82] var_1_30 = (var_1_33 - ((((var_1_34) > ((var_1_35 - var_1_36))) ? (var_1_34) : ((var_1_35 - var_1_36))))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L86] COND FALSE !(((((var_1_1) > (var_1_10)) ? (var_1_1) : (var_1_10))) > var_1_32) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L93] var_1_38 = var_1_34 [L94] var_1_39 = var_1_11 [L95] signed long int stepLocal_0 = (((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_0=1, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-55486, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L96] COND FALSE !(stepLocal_0 <= last_1_var_1_8) [L103] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=65537, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-55486, var_1_4=1, var_1_7=65537, var_1_8=-10, var_1_9=1] [L105] COND TRUE (- var_1_7) < (var_1_1 * var_1_4) [L106] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=65537, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-55486, var_1_4=1, var_1_7=65537, var_1_8=1, var_1_9=1] [L108] COND FALSE !((var_1_6 * var_1_2) <= var_1_3) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=65537, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-55486, var_1_4=1, var_1_7=65537, var_1_8=1, var_1_9=1] [L115] signed long int stepLocal_1 = var_1_16 - (var_1_17 - 256); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=12923, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=65537, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-55486, var_1_4=1, var_1_7=65537, var_1_8=1, var_1_9=1] [L116] COND FALSE !(var_1_3 != var_1_6) [L123] var_1_15 = var_1_18 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=12923, var_1_10=8, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=65537, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-55486, var_1_4=1, var_1_7=65537, var_1_8=1, var_1_9=1] [L125] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) [L126] unsigned short int stepLocal_4 = var_1_1; [L127] signed long int stepLocal_3 = var_1_7 + (128 + var_1_1); [L128] signed long int stepLocal_2 = - var_1_10; VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=12923, stepLocal_2=-20100, stepLocal_3=130, stepLocal_4=65537, var_1_10=20100, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=65537, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-55486, var_1_4=1, var_1_7=65537, var_1_8=1, var_1_9=1] [L129] COND FALSE !(var_1_1 < stepLocal_2) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=12923, stepLocal_3=130, stepLocal_4=65537, var_1_10=20100, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=-50, var_1_1=65537, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-55486, var_1_4=1, var_1_7=65537, var_1_8=1, var_1_9=1] [L134] COND TRUE stepLocal_4 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11) [L135] var_1_19 = ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=12923, stepLocal_3=130, var_1_10=20100, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=1, var_1_1=65537, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-55486, var_1_4=1, var_1_7=65537, var_1_8=1, var_1_9=1] [L207] RET step() [L208] CALL, EXPR property() [L198-L199] return ((((((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) <= last_1_var_1_8) ? (((- var_1_3) > ((((var_1_2) > (var_1_6)) ? (var_1_2) : (var_1_6)))) ? (var_1_1 == ((unsigned short int) var_1_7)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) && (((- var_1_7) < (var_1_1 * var_1_4)) ? (var_1_8 == ((signed char) var_1_9)) : 1)) && (var_1_10 == ((unsigned short int) (50 + ((var_1_11 + 10000) - var_1_12))))) && (((var_1_6 * var_1_2) <= var_1_3) ? (last_1_var_1_15 ? (var_1_13 == ((signed short int) (-10 + var_1_12))) : (var_1_13 == ((signed short int) var_1_4))) : 1)) && ((var_1_3 != var_1_6) ? ((var_1_13 >= (var_1_16 - (var_1_17 - 256))) ? (var_1_15 == ((unsigned char) var_1_18)) : (var_1_15 == ((unsigned char) var_1_18))) : (var_1_15 == ((unsigned char) var_1_18)))) && ((var_1_1 < (- var_1_10)) ? (((var_1_7 + (128 + var_1_1)) <= last_1_var_1_19) ? (var_1_19 == ((signed long int) var_1_4)) : 1) : ((var_1_1 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11)) ? (var_1_19 == ((signed long int) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : (var_1_19 == ((signed long int) var_1_16)))) ; VAL [\result=0, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=20100, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=1, var_1_1=65537, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-55486, var_1_4=1, var_1_7=65537, var_1_8=1, var_1_9=1] [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=20100, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=1, var_1_1=65537, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-55486, var_1_4=1, var_1_7=65537, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=20100, var_1_11=-55486, var_1_12=-655360, var_1_13=200, var_1_15=0, var_1_16=-32769, var_1_17=-45436, var_1_18=0, var_1_19=1, var_1_1=65537, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=-193, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-55486, var_1_4=1, var_1_7=65537, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 7, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 878 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 869 mSDsluCounter, 2034 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1228 mSDsCounter, 405 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 868 IncrementalHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 405 mSolverCounterUnsat, 806 mSDtfsCounter, 868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1121 GetRequests, 1049 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=6, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 152 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2044 NumberOfCodeBlocks, 2044 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1826 ConstructedInterpolants, 0 QuantifiedInterpolants, 6757 SizeOfPredicates, 7 NumberOfNonLiveVariables, 943 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 17433/17856 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 06:57:01,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.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 90d2ecb269ea751b29d0bf6d98b8e81014506e0b0b654fb9f2949f1dc1fe64a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:57:03,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:57:04,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:57:04,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:57:04,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:57:04,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:57:04,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:57:04,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:57:04,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:57:04,130 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:57:04,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:57:04,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:57:04,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:57:04,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:57:04,130 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:57:04,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:57:04,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:57:04,131 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:57:04,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:57:04,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:57:04,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:57:04,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:57:04,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:57:04,132 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:57:04,132 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:57:04,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:57:04,132 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:57:04,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:57:04,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:57:04,132 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:57:04,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:57:04,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:57:04,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:57:04,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:57:04,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:57:04,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:57:04,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:57:04,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:57:04,133 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:57:04,133 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:57:04,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:57:04,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:57:04,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:57:04,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:57:04,134 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 -> 90d2ecb269ea751b29d0bf6d98b8e81014506e0b0b654fb9f2949f1dc1fe64a3 [2024-11-07 06:57:04,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:57:04,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:57:04,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:57:04,415 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:57:04,415 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:57:04,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2024-11-07 06:57:05,675 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:57:05,954 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:57:05,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2024-11-07 06:57:05,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d8b88589/0cff214a5b3d4a4096d402534792dfa1/FLAG57a9ce92b [2024-11-07 06:57:05,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d8b88589/0cff214a5b3d4a4096d402534792dfa1 [2024-11-07 06:57:05,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:57:05,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:57:05,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:57:05,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:57:05,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:57:05,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:57:05" (1/1) ... [2024-11-07 06:57:05,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c44b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:05, skipping insertion in model container [2024-11-07 06:57:05,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:57:05" (1/1) ... [2024-11-07 06:57:06,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:57:06,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i[919,932] [2024-11-07 06:57:06,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:57:06,175 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:57:06,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i[919,932] [2024-11-07 06:57:06,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:57:06,254 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:57:06,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06 WrapperNode [2024-11-07 06:57:06,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:57:06,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:57:06,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:57:06,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:57:06,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06" (1/1) ... [2024-11-07 06:57:06,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06" (1/1) ... [2024-11-07 06:57:06,318 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-07 06:57:06,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:57:06,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:57:06,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:57:06,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:57:06,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06" (1/1) ... [2024-11-07 06:57:06,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06" (1/1) ... [2024-11-07 06:57:06,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06" (1/1) ... [2024-11-07 06:57:06,366 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 06:57:06,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06" (1/1) ... [2024-11-07 06:57:06,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06" (1/1) ... [2024-11-07 06:57:06,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06" (1/1) ... [2024-11-07 06:57:06,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06" (1/1) ... [2024-11-07 06:57:06,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06" (1/1) ... [2024-11-07 06:57:06,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06" (1/1) ... [2024-11-07 06:57:06,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:57:06,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:57:06,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:57:06,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:57:06,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06" (1/1) ... [2024-11-07 06:57:06,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:57:06,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:57:06,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 06:57:06,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 06:57:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:57:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:57:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:57:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:57:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:57:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:57:06,576 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:57:06,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:57:07,685 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 06:57:07,686 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:57:07,697 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:57:07,698 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:57:07,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:07 BoogieIcfgContainer [2024-11-07 06:57:07,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:57:07,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:57:07,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:57:07,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:57:07,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:57:05" (1/3) ... [2024-11-07 06:57:07,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325802a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:57:07, skipping insertion in model container [2024-11-07 06:57:07,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:06" (2/3) ... [2024-11-07 06:57:07,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325802a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:57:07, skipping insertion in model container [2024-11-07 06:57:07,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:07" (3/3) ... [2024-11-07 06:57:07,708 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2024-11-07 06:57:07,717 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:57:07,718 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:57:07,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:57:07,789 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;@34f10d7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:57:07,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:57:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:57:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-07 06:57:07,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:07,803 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:07,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:07,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:07,807 INFO L85 PathProgramCache]: Analyzing trace with hash 84506934, now seen corresponding path program 1 times [2024-11-07 06:57:07,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:57:07,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277674033] [2024-11-07 06:57:07,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:07,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:57:07,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:57:07,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:57:07,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 06:57:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:08,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:57:08,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1490 trivial. 0 not checked. [2024-11-07 06:57:08,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:57:08,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:57:08,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277674033] [2024-11-07 06:57:08,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277674033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:08,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:57:08,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:57:08,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598791748] [2024-11-07 06:57:08,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:08,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:57:08,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:57:08,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:57:08,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:57:08,191 INFO L87 Difference]: Start difference. First operand has 93 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:57:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:08,227 INFO L93 Difference]: Finished difference Result 179 states and 322 transitions. [2024-11-07 06:57:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:57:08,230 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 201 [2024-11-07 06:57:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:08,241 INFO L225 Difference]: With dead ends: 179 [2024-11-07 06:57:08,241 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 06:57:08,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:57:08,255 INFO L432 NwaCegarLoop]: 140 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, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:08,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:57:08,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 06:57:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-07 06:57:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:57:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 140 transitions. [2024-11-07 06:57:08,299 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 140 transitions. Word has length 201 [2024-11-07 06:57:08,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:08,300 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 140 transitions. [2024-11-07 06:57:08,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:57:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2024-11-07 06:57:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-07 06:57:08,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:08,305 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:08,327 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 06:57:08,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:57:08,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:08,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:08,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1974484808, now seen corresponding path program 1 times [2024-11-07 06:57:08,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:57:08,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859079143] [2024-11-07 06:57:08,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:08,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:57:08,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:57:08,512 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:57:08,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 06:57:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:08,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:57:08,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2024-11-07 06:57:09,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:57:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 06:57:09,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:57:09,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859079143] [2024-11-07 06:57:09,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859079143] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:57:09,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:57:09,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 06:57:09,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613169605] [2024-11-07 06:57:09,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:57:09,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:57:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:57:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:57:09,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:57:09,231 INFO L87 Difference]: Start difference. First operand 89 states and 140 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-07 06:57:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:09,639 INFO L93 Difference]: Finished difference Result 183 states and 284 transitions. [2024-11-07 06:57:09,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:57:09,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 201 [2024-11-07 06:57:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:09,651 INFO L225 Difference]: With dead ends: 183 [2024-11-07 06:57:09,651 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 06:57:09,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:57:09,654 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 75 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:09,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 217 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:57:09,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 06:57:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-11-07 06:57:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:57:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2024-11-07 06:57:09,676 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 201 [2024-11-07 06:57:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:09,677 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2024-11-07 06:57:09,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-07 06:57:09,678 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2024-11-07 06:57:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-07 06:57:09,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:09,683 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:09,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 06:57:09,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:57:09,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:09,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:09,889 INFO L85 PathProgramCache]: Analyzing trace with hash 788011127, now seen corresponding path program 1 times [2024-11-07 06:57:09,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:57:09,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453829226] [2024-11-07 06:57:09,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:09,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:57:09,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:57:09,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:57:09,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 06:57:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:10,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:57:10,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:57:10,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:57:10,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:57:10,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453829226] [2024-11-07 06:57:10,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453829226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:10,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:57:10,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:57:10,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853182667] [2024-11-07 06:57:10,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:10,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:57:10,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:57:10,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:57:10,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:57:10,613 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:57:10,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:10,936 INFO L93 Difference]: Finished difference Result 262 states and 396 transitions. [2024-11-07 06:57:10,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:57:10,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 202 [2024-11-07 06:57:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:10,939 INFO L225 Difference]: With dead ends: 262 [2024-11-07 06:57:10,939 INFO L226 Difference]: Without dead ends: 172 [2024-11-07 06:57:10,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 200 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 06:57:10,941 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 25 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:10,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 258 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:57:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-07 06:57:10,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 160. [2024-11-07 06:57:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 91 states have internal predecessors, (111), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:57:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 239 transitions. [2024-11-07 06:57:10,974 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 239 transitions. Word has length 202 [2024-11-07 06:57:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:10,975 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 239 transitions. [2024-11-07 06:57:10,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:57:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 239 transitions. [2024-11-07 06:57:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 06:57:10,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:10,978 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:10,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 06:57:11,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:57:11,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:11,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:11,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1906378083, now seen corresponding path program 1 times [2024-11-07 06:57:11,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:57:11,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427946778] [2024-11-07 06:57:11,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:11,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:57:11,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:57:11,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:57:11,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 06:57:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:11,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:57:11,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:57:11,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:57:11,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:57:11,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427946778] [2024-11-07 06:57:11,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427946778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:11,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:57:11,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:57:11,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565047247] [2024-11-07 06:57:11,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:11,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:57:11,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:57:11,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:57:11,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:57:11,470 INFO L87 Difference]: Start difference. First operand 160 states and 239 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:57:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:11,848 INFO L93 Difference]: Finished difference Result 249 states and 373 transitions. [2024-11-07 06:57:11,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:57:11,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-11-07 06:57:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:11,860 INFO L225 Difference]: With dead ends: 249 [2024-11-07 06:57:11,860 INFO L226 Difference]: Without dead ends: 159 [2024-11-07 06:57:11,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 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 06:57:11,862 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:11,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:57:11,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-07 06:57:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-07 06:57:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 90 states have (on average 1.2) internal successors, (108), 90 states have internal predecessors, (108), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:57:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 236 transitions. [2024-11-07 06:57:11,900 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 236 transitions. Word has length 203 [2024-11-07 06:57:11,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:11,902 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 236 transitions. [2024-11-07 06:57:11,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:57:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 236 transitions. [2024-11-07 06:57:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 06:57:11,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:11,907 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:11,920 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 (5)] Ended with exit code 0 [2024-11-07 06:57:12,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:57:12,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:12,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:12,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956707, now seen corresponding path program 1 times [2024-11-07 06:57:12,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:57:12,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592327258] [2024-11-07 06:57:12,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:12,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:57:12,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:57:12,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:57:12,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 06:57:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:12,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 06:57:12,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-11-07 06:57:13,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:57:13,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:57:13,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592327258] [2024-11-07 06:57:13,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592327258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:57:13,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [303953252] [2024-11-07 06:57:13,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:13,248 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:57:13,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:57:13,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 06:57:13,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-07 06:57:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:14,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 06:57:14,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-11-07 06:57:14,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:57:14,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [303953252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:57:14,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:57:14,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-07 06:57:14,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722046947] [2024-11-07 06:57:14,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:57:14,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:57:14,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:57:14,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:57:14,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:57:14,766 INFO L87 Difference]: Start difference. First operand 159 states and 236 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-07 06:57:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:15,918 INFO L93 Difference]: Finished difference Result 278 states and 395 transitions. [2024-11-07 06:57:15,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 06:57:15,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 203 [2024-11-07 06:57:15,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:15,939 INFO L225 Difference]: With dead ends: 278 [2024-11-07 06:57:15,939 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 06:57:15,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-07 06:57:15,941 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 60 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:15,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 264 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 06:57:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 06:57:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 175. [2024-11-07 06:57:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 102 states have (on average 1.1568627450980393) internal successors, (118), 102 states have internal predecessors, (118), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:57:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 246 transitions. [2024-11-07 06:57:15,963 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 246 transitions. Word has length 203 [2024-11-07 06:57:15,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:15,963 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 246 transitions. [2024-11-07 06:57:15,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-07 06:57:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 246 transitions. [2024-11-07 06:57:15,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 06:57:15,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:15,972 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:15,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-07 06:57:16,186 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 (6)] Ended with exit code 0 [2024-11-07 06:57:16,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:57:16,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:16,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1230215280, now seen corresponding path program 1 times [2024-11-07 06:57:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:57:16,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922661126] [2024-11-07 06:57:16,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:16,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:57:16,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:57:16,387 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:57:16,390 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 (8)] Waiting until timeout for monitored process [2024-11-07 06:57:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:16,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 06:57:16,682 INFO L278 TraceCheckSpWp]: Computing forward predicates...