./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '5fae3db68adc0ffe998fc93858a245ffb30205c57f234c7f9849920ee7dba257'] 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-51.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fae3db68adc0ffe998fc93858a245ffb30205c57f234c7f9849920ee7dba257 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:53:48,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:53:48,155 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:53:48,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:53:48,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:53:48,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:53:48,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:53:48,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:53:48,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:53:48,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:53:48,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:53:48,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:53:48,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:53:48,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:53:48,178 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:53:48,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:53:48,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:53:48,178 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:53:48,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:53:48,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:53:48,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:53:48,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:53:48,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:53:48,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:53:48,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:53:48,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:53:48,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:53:48,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:53:48,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:53:48,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:53:48,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:53:48,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:53:48,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:53:48,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:53:48,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:53:48,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:53:48,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:53:48,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:53:48,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:53:48,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:53:48,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:53:48,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:53:48,181 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 -> 5fae3db68adc0ffe998fc93858a245ffb30205c57f234c7f9849920ee7dba257 [2024-11-07 06:53:48,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:53:48,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:53:48,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:53:48,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:53:48,421 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:53:48,422 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-51.i [2024-11-07 06:53:49,550 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:53:49,785 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:53:49,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i [2024-11-07 06:53:49,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9066f86f/0ae96f3860fa4512af72a11174114027/FLAG2a9a56a24 [2024-11-07 06:53:50,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9066f86f/0ae96f3860fa4512af72a11174114027 [2024-11-07 06:53:50,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:53:50,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:53:50,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:53:50,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:53:50,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:53:50,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:53:50" (1/1) ... [2024-11-07 06:53:50,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdc4900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:53:50, skipping insertion in model container [2024-11-07 06:53:50,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:53:50" (1/1) ... [2024-11-07 06:53:50,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:53:50,243 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-51.i[919,932] [2024-11-07 06:53:50,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:53:50,300 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:53:50,307 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-51.i[919,932] [2024-11-07 06:53:50,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:53:50,358 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:53:50,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:53:50 WrapperNode [2024-11-07 06:53:50,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:53:50,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:53:50,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:53:50,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:53:50,364 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:53:50" (1/1) ... [2024-11-07 06:53:50,370 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:53:50" (1/1) ... [2024-11-07 06:53:50,391 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-07 06:53:50,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:53:50,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:53:50,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:53:50,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:53:50,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:53:50" (1/1) ... [2024-11-07 06:53:50,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:53:50" (1/1) ... [2024-11-07 06:53:50,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:53:50" (1/1) ... [2024-11-07 06:53:50,415 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:53:50,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:53:50" (1/1) ... [2024-11-07 06:53:50,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:53:50" (1/1) ... [2024-11-07 06:53:50,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:53:50" (1/1) ... [2024-11-07 06:53:50,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:53:50" (1/1) ... [2024-11-07 06:53:50,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:53:50" (1/1) ... [2024-11-07 06:53:50,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:53:50" (1/1) ... [2024-11-07 06:53:50,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:53:50,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:53:50,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:53:50,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:53:50,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:53:50" (1/1) ... [2024-11-07 06:53:50,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:53:50,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:53:50,459 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:53:50,465 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:53:50,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:53:50,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:53:50,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:53:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:53:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:53:50,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:53:50,554 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:53:50,555 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:53:50,825 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 06:53:50,825 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:53:50,834 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:53:50,837 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 06:53:50,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:53:50 BoogieIcfgContainer [2024-11-07 06:53:50,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:53:50,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:53:50,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:53:50,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:53:50,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:53:50" (1/3) ... [2024-11-07 06:53:50,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f906eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:53:50, skipping insertion in model container [2024-11-07 06:53:50,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:53:50" (2/3) ... [2024-11-07 06:53:50,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f906eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:53:50, skipping insertion in model container [2024-11-07 06:53:50,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:53:50" (3/3) ... [2024-11-07 06:53:50,853 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i [2024-11-07 06:53:50,867 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:53:50,868 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:53:50,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:53:50,922 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;@6013b4b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:53:50,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:53:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 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:53:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 06:53:50,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:53:50,941 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:53:50,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:53:50,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:53:50,946 INFO L85 PathProgramCache]: Analyzing trace with hash 114399864, now seen corresponding path program 1 times [2024-11-07 06:53:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:53:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422649430] [2024-11-07 06:53:50,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:53:50,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:53:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:53:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:53:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:53:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:53:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:53:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:53:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:53:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:53:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:53:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:53:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:53:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:53:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:53:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:53:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:53:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:53:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:53:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:53:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:53:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:53:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:53:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:53:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:53:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:53:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:53:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:53:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:53:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:53:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:53:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:53:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:53:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:53:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,343 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:53:51,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:53:51,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422649430] [2024-11-07 06:53:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422649430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:53:51,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:53:51,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:53:51,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313012322] [2024-11-07 06:53:51,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:53:51,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:53:51,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:53:51,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:53:51,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:53:51,368 INFO L87 Difference]: Start difference. First operand has 96 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 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.5) internal successors, (47), 2 states have internal predecessors, (47), 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:53:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:53:51,389 INFO L93 Difference]: Finished difference Result 184 states and 326 transitions. [2024-11-07 06:53:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:53:51,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 204 [2024-11-07 06:53:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:53:51,395 INFO L225 Difference]: With dead ends: 184 [2024-11-07 06:53:51,395 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 06:53:51,397 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:53:51,398 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:53:51,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:53:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 06:53:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 06:53:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 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:53:51,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 141 transitions. [2024-11-07 06:53:51,442 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 141 transitions. Word has length 204 [2024-11-07 06:53:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:53:51,443 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 141 transitions. [2024-11-07 06:53:51,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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:53:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 141 transitions. [2024-11-07 06:53:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 06:53:51,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:53:51,448 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:53:51,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:53:51,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:53:51,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:53:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1167317964, now seen corresponding path program 1 times [2024-11-07 06:53:51,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:53:51,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985696510] [2024-11-07 06:53:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:53:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:53:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:53:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:53:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:53:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:53:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:53:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:53:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:53:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:53:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:53:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:53:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:53:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:53:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:53:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:53:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:53:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:53:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:53:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:53:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:53:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:53:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:53:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:53:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:53:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:53:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:53:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:53:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:53:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:53:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:53:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:53:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:53:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:53:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,088 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:53:52,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:53:52,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985696510] [2024-11-07 06:53:52,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985696510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:53:52,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:53:52,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:53:52,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056560822] [2024-11-07 06:53:52,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:53:52,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:53:52,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:53:52,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:53:52,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:53:52,092 INFO L87 Difference]: Start difference. First operand 91 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:53:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:53:52,325 INFO L93 Difference]: Finished difference Result 268 states and 418 transitions. [2024-11-07 06:53:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:53:52,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-11-07 06:53:52,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:53:52,328 INFO L225 Difference]: With dead ends: 268 [2024-11-07 06:53:52,328 INFO L226 Difference]: Without dead ends: 180 [2024-11-07 06:53:52,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:53:52,329 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 103 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:53:52,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 396 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:53:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-07 06:53:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 159. [2024-11-07 06:53:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 92 states have internal predecessors, (118), 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:53:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 246 transitions. [2024-11-07 06:53:52,363 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 246 transitions. Word has length 204 [2024-11-07 06:53:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:53:52,363 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 246 transitions. [2024-11-07 06:53:52,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:53:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 246 transitions. [2024-11-07 06:53:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-07 06:53:52,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:53:52,367 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:53:52,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:53:52,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:53:52,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:53:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1525479022, now seen corresponding path program 1 times [2024-11-07 06:53:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:53:52,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875471531] [2024-11-07 06:53:52,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:53:52,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:53:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:53:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:53:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:53:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:53:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:53:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:53:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:53:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:53:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:53:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:53:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:53:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:53:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:53:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:53:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:53:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:53:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:53:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:53:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:53:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:53:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:53:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:53:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:53:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:53:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:53:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:53:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:53:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:53:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:53:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:53:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:53:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:53:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:52,862 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:53:52,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:53:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875471531] [2024-11-07 06:53:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875471531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:53:52,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:53:52,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:53:52,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329079894] [2024-11-07 06:53:52,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:53:52,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:53:52,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:53:52,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:53:52,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:53:52,866 INFO L87 Difference]: Start difference. First operand 159 states and 246 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:53:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:53:53,104 INFO L93 Difference]: Finished difference Result 342 states and 529 transitions. [2024-11-07 06:53:53,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:53:53,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:53:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:53:53,107 INFO L225 Difference]: With dead ends: 342 [2024-11-07 06:53:53,107 INFO L226 Difference]: Without dead ends: 254 [2024-11-07 06:53:53,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:53:53,108 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 116 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:53:53,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 482 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:53:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-07 06:53:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 245. [2024-11-07 06:53:53,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 145 states have internal predecessors, (190), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-07 06:53:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 382 transitions. [2024-11-07 06:53:53,153 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 382 transitions. Word has length 205 [2024-11-07 06:53:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:53:53,154 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 382 transitions. [2024-11-07 06:53:53,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:53:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 382 transitions. [2024-11-07 06:53:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 06:53:53,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:53:53,159 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:53:53,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:53:53,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:53:53,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:53:53,160 INFO L85 PathProgramCache]: Analyzing trace with hash 523048267, now seen corresponding path program 1 times [2024-11-07 06:53:53,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:53:53,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263039319] [2024-11-07 06:53:53,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:53:53,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:53:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:53:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:53:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:53:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:53:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:53:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:53:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:53:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:53:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:53:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:53:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:53:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:53:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:53:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:53:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:53:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:53:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:53:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:53:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:53:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:53:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:53:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:53:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:53:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:53:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:53:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:53:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:53:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:53:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:53:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:53:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:53:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:53:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,472 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:53:53,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:53:53,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263039319] [2024-11-07 06:53:53,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263039319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:53:53,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:53:53,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:53:53,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484697328] [2024-11-07 06:53:53,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:53:53,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:53:53,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:53:53,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:53:53,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:53:53,476 INFO L87 Difference]: Start difference. First operand 245 states and 382 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:53:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:53:53,702 INFO L93 Difference]: Finished difference Result 593 states and 930 transitions. [2024-11-07 06:53:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:53:53,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 206 [2024-11-07 06:53:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:53:53,705 INFO L225 Difference]: With dead ends: 593 [2024-11-07 06:53:53,705 INFO L226 Difference]: Without dead ends: 419 [2024-11-07 06:53:53,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:53:53,707 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 111 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:53:53,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 362 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:53:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-07 06:53:53,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2024-11-07 06:53:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 251 states have (on average 1.3266932270916334) internal successors, (333), 251 states have internal predecessors, (333), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-07 06:53:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 653 transitions. [2024-11-07 06:53:53,756 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 653 transitions. Word has length 206 [2024-11-07 06:53:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:53:53,756 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 653 transitions. [2024-11-07 06:53:53,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:53:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 653 transitions. [2024-11-07 06:53:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 06:53:53,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:53:53,758 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:53:53,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:53:53,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:53:53,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:53:53,759 INFO L85 PathProgramCache]: Analyzing trace with hash 130021257, now seen corresponding path program 1 times [2024-11-07 06:53:53,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:53:53,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039221635] [2024-11-07 06:53:53,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:53:53,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:53:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:53:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:53:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:53:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:53:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:53:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:53:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:53:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:53:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:53:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:53:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:53:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:53:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:53:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:53:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:53:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:53:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:53:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:53:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:53:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:53:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:53:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:53:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:53:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:53:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:53:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:53:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:53:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:53:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:53:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:53:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:53:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:53:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:53,947 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:53:53,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:53:53,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039221635] [2024-11-07 06:53:53,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039221635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:53:53,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:53:53,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:53:53,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350200575] [2024-11-07 06:53:53,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:53:53,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:53:53,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:53:53,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:53:53,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:53:53,949 INFO L87 Difference]: Start difference. First operand 417 states and 653 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:53:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:53:54,007 INFO L93 Difference]: Finished difference Result 773 states and 1215 transitions. [2024-11-07 06:53:54,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:53:54,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 206 [2024-11-07 06:53:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:53:54,010 INFO L225 Difference]: With dead ends: 773 [2024-11-07 06:53:54,011 INFO L226 Difference]: Without dead ends: 427 [2024-11-07 06:53:54,012 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:53:54,012 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 17 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:53:54,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 285 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:53:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-07 06:53:54,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 417. [2024-11-07 06:53:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 251 states have (on average 1.3107569721115537) internal successors, (329), 251 states have internal predecessors, (329), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-07 06:53:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 649 transitions. [2024-11-07 06:53:54,070 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 649 transitions. Word has length 206 [2024-11-07 06:53:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:53:54,070 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 649 transitions. [2024-11-07 06:53:54,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:53:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 649 transitions. [2024-11-07 06:53:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 06:53:54,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:53:54,072 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, 1] [2024-11-07 06:53:54,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:53:54,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:53:54,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:53:54,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1080240871, now seen corresponding path program 1 times [2024-11-07 06:53:54,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:53:54,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918104015] [2024-11-07 06:53:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:53:54,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:53:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:53:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:53:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:53:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:53:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:53:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:53:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:53:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:53:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:53:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:53:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:53:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:53:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:53:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:53:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:53:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:53:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:53:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:53:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:53:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:53:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:53:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:53:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:53:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:53:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:53:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:53:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:53:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:53:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:53:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:53:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:53:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:53:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,323 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:53:54,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:53:54,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918104015] [2024-11-07 06:53:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918104015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:53:54,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003065631] [2024-11-07 06:53:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:53:54,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:53:54,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:53:54,326 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:53:54,327 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:53:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:54,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:53:54,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:53:54,672 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:53:54,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:53:54,912 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:53:54,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003065631] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:53:54,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:53:54,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 06:53:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691551267] [2024-11-07 06:53:54,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:53:54,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:53:54,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:53:54,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:53:54,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:53:54,915 INFO L87 Difference]: Start difference. First operand 417 states and 649 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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:53:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:53:55,146 INFO L93 Difference]: Finished difference Result 805 states and 1227 transitions. [2024-11-07 06:53:55,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:53:55,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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 207 [2024-11-07 06:53:55,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:53:55,150 INFO L225 Difference]: With dead ends: 805 [2024-11-07 06:53:55,150 INFO L226 Difference]: Without dead ends: 457 [2024-11-07 06:53:55,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:53:55,151 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 188 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:53:55,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 236 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:53:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-07 06:53:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 437. [2024-11-07 06:53:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 266 states have (on average 1.2744360902255638) internal successors, (339), 266 states have internal predecessors, (339), 160 states have call successors, (160), 10 states have call predecessors, (160), 10 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-07 06:53:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 659 transitions. [2024-11-07 06:53:55,205 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 659 transitions. Word has length 207 [2024-11-07 06:53:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:53:55,206 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 659 transitions. [2024-11-07 06:53:55,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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:53:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 659 transitions. [2024-11-07 06:53:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 06:53:55,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:53:55,208 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, 1, 1] [2024-11-07 06:53:55,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 06:53:55,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:53:55,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:53:55,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:53:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash 805706601, now seen corresponding path program 1 times [2024-11-07 06:53:55,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:53:55,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620238503] [2024-11-07 06:53:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:53:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:53:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:53:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:53:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:53:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:53:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:53:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:53:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:53:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:53:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:53:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:53:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:53:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:53:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:53:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:53:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:53:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:53:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:53:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:53:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:53:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:53:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:53:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:53:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:53:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:53:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:53:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:53:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:53:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:53:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:53:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:53:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:53:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:53:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:55,628 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:53:55,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:53:55,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620238503] [2024-11-07 06:53:55,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620238503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:53:55,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:53:55,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:53:55,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306619310] [2024-11-07 06:53:55,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:53:55,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:53:55,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:53:55,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:53:55,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:53:55,629 INFO L87 Difference]: Start difference. First operand 437 states and 659 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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:53:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:53:55,808 INFO L93 Difference]: Finished difference Result 1032 states and 1543 transitions. [2024-11-07 06:53:55,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:53:55,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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 208 [2024-11-07 06:53:55,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:53:55,814 INFO L225 Difference]: With dead ends: 1032 [2024-11-07 06:53:55,814 INFO L226 Difference]: Without dead ends: 670 [2024-11-07 06:53:55,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:53:55,816 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 181 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:53:55,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 477 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:53:55,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-11-07 06:53:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 611. [2024-11-07 06:53:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 365 states have (on average 1.210958904109589) internal successors, (442), 365 states have internal predecessors, (442), 224 states have call successors, (224), 21 states have call predecessors, (224), 21 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2024-11-07 06:53:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 890 transitions. [2024-11-07 06:53:55,879 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 890 transitions. Word has length 208 [2024-11-07 06:53:55,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:53:55,880 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 890 transitions. [2024-11-07 06:53:55,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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:53:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 890 transitions. [2024-11-07 06:53:55,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 06:53:55,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:53:55,881 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, 1, 1, 1] [2024-11-07 06:53:55,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:53:55,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:53:55,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:53:55,882 INFO L85 PathProgramCache]: Analyzing trace with hash -737550210, now seen corresponding path program 1 times [2024-11-07 06:53:55,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:53:55,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74336765] [2024-11-07 06:53:55,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:53:55,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:53:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:53:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:53:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:53:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:53:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:53:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:53:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:53:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:53:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:53:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:53:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:53:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:53:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:53:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:53:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:53:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:53:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:53:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:53:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:53:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:53:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:53:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:53:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:53:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:53:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 06:53:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 06:53:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:53:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:53:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 06:53:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:53:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:53:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:53:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 144 proven. 36 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2024-11-07 06:53:56,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:53:56,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74336765] [2024-11-07 06:53:56,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74336765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:53:56,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866503770] [2024-11-07 06:53:56,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:53:56,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:53:56,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:53:56,752 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:53:56,754 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:53:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:53:56,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 06:53:56,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:53:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1056 proven. 36 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [2024-11-07 06:53:57,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:53:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 144 proven. 39 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-11-07 06:53:58,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866503770] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:53:58,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:53:58,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 25 [2024-11-07 06:53:58,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927948114] [2024-11-07 06:53:58,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:53:58,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 06:53:58,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:53:58,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 06:53:58,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2024-11-07 06:53:58,213 INFO L87 Difference]: Start difference. First operand 611 states and 890 transitions. Second operand has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 22 states have internal predecessors, (127), 11 states have call successors, (96), 5 states have call predecessors, (96), 10 states have return successors, (96), 14 states have call predecessors, (96), 11 states have call successors, (96) [2024-11-07 06:53:59,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:53:59,775 INFO L93 Difference]: Finished difference Result 1453 states and 2039 transitions. [2024-11-07 06:53:59,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 06:53:59,776 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 22 states have internal predecessors, (127), 11 states have call successors, (96), 5 states have call predecessors, (96), 10 states have return successors, (96), 14 states have call predecessors, (96), 11 states have call successors, (96) Word has length 209 [2024-11-07 06:53:59,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:53:59,784 INFO L225 Difference]: With dead ends: 1453 [2024-11-07 06:53:59,785 INFO L226 Difference]: Without dead ends: 910 [2024-11-07 06:53:59,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=597, Invalid=1659, Unknown=0, NotChecked=0, Total=2256 [2024-11-07 06:53:59,789 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 517 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:53:59,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 754 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 06:53:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-07 06:53:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 829. [2024-11-07 06:53:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 500 states have (on average 1.174) internal successors, (587), 503 states have internal predecessors, (587), 287 states have call successors, (287), 41 states have call predecessors, (287), 41 states have return successors, (287), 284 states have call predecessors, (287), 287 states have call successors, (287) [2024-11-07 06:53:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1161 transitions. [2024-11-07 06:53:59,887 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1161 transitions. Word has length 209 [2024-11-07 06:53:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:53:59,887 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1161 transitions. [2024-11-07 06:53:59,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 22 states have internal predecessors, (127), 11 states have call successors, (96), 5 states have call predecessors, (96), 10 states have return successors, (96), 14 states have call predecessors, (96), 11 states have call successors, (96) [2024-11-07 06:53:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1161 transitions. [2024-11-07 06:53:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 06:53:59,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:53:59,890 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, 1, 1, 1] [2024-11-07 06:53:59,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 06:54:00,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:54:00,092 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:54:00,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:54:00,092 INFO L85 PathProgramCache]: Analyzing trace with hash -675510596, now seen corresponding path program 1 times [2024-11-07 06:54:00,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:54:00,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90641213] [2024-11-07 06:54:00,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:54:00,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:54:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:54:00,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [500335586] [2024-11-07 06:54:00,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:54:00,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:54:00,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:54:00,156 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:54:00,157 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:54:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:54:00,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:54:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:54:00,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:54:00,465 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:54:00,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:54:00,475 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:54:00,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:54:00,670 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:54:00,785 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:54:00,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:54:00 BoogieIcfgContainer [2024-11-07 06:54:00,788 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:54:00,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:54:00,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:54:00,790 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:54:00,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:53:50" (3/4) ... [2024-11-07 06:54:00,792 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:54:00,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:54:00,793 INFO L158 Benchmark]: Toolchain (without parser) took 10662.86ms. Allocated memory was 117.4MB in the beginning and 310.4MB in the end (delta: 192.9MB). Free memory was 91.6MB in the beginning and 166.7MB in the end (delta: -75.1MB). Peak memory consumption was 114.9MB. Max. memory is 16.1GB. [2024-11-07 06:54:00,794 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:54:00,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.48ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 76.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:54:00,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.87ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 73.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:54:00,794 INFO L158 Benchmark]: Boogie Preprocessor took 36.86ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 69.8MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:54:00,795 INFO L158 Benchmark]: RCFGBuilder took 408.24ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 46.5MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:54:00,795 INFO L158 Benchmark]: TraceAbstraction took 9949.00ms. Allocated memory was 117.4MB in the beginning and 310.4MB in the end (delta: 192.9MB). Free memory was 46.0MB in the beginning and 166.8MB in the end (delta: -120.8MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2024-11-07 06:54:00,795 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 310.4MB. Free memory was 166.8MB in the beginning and 166.7MB in the end (delta: 78.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:54:00,796 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.21ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.48ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 76.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.87ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 73.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.86ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 69.8MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 408.24ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 46.5MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9949.00ms. Allocated memory was 117.4MB in the beginning and 310.4MB in the end (delta: 192.9MB). Free memory was 46.0MB in the beginning and 166.8MB in the end (delta: -120.8MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 310.4MB. Free memory was 166.8MB in the beginning and 166.7MB in the end (delta: 78.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 206, overapproximation of someBinaryFLOATComparisonOperation at line 194, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] float var_1_25 = -0.575; [L41] signed char var_1_27 = 5; [L42] signed char var_1_28 = 1; [L43] float var_1_30 = 10.8; [L44] float var_1_31 = 49.2; [L45] float var_1_32 = 0.4; [L46] unsigned char var_1_33 = 10; [L47] unsigned char var_1_37 = 64; [L48] signed char var_1_38 = -8; [L49] unsigned short int var_1_40 = 200; [L50] unsigned long int var_1_42 = 2; [L51] unsigned long int var_1_44 = 10; [L52] unsigned short int var_1_45 = 16; [L53] unsigned char last_1_var_1_1 = 128; [L54] unsigned long int last_1_var_1_12 = 8; [L55] double last_1_var_1_17 = 256.8; [L56] unsigned char last_1_var_1_21 = 1; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L210] isInitial = 1 [L211] FCALL initially() [L212] COND TRUE 1 [L213] CALL updateLastVariables() [L200] last_1_var_1_1 = var_1_1 [L201] last_1_var_1_12 = var_1_12 [L202] last_1_var_1_17 = var_1_17 [L203] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L213] RET updateLastVariables() [L214] CALL updateVariables() [L148] var_1_4 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L149] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L150] var_1_5 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L151] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L152] var_1_7 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L153] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L154] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=5] [L154] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=5] [L155] var_1_9 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L156] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L157] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L157] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L158] var_1_10 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L159] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L160] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L160] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L161] var_1_11 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L162] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L163] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L163] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L164] var_1_13 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L165] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L166] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L166] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L167] var_1_15 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L168] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L169] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L169] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L170] var_1_18 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L171] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L172] var_1_22 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L173] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L174] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L174] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L175] var_1_23 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L176] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L177] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L177] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L178] var_1_24 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L179] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L180] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L180] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L181] var_1_27 = __VERIFIER_nondet_char() [L182] CALL assume_abort_if_not(var_1_27 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L182] RET assume_abort_if_not(var_1_27 >= -128) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L183] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L183] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L184] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L184] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L185] var_1_28 = __VERIFIER_nondet_char() [L186] CALL assume_abort_if_not(var_1_28 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L186] RET assume_abort_if_not(var_1_28 >= -128) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L187] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L187] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L188] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L188] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L189] var_1_30 = __VERIFIER_nondet_float() [L190] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L190] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L191] var_1_31 = __VERIFIER_nondet_float() [L192] CALL assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L192] RET assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L193] var_1_32 = __VERIFIER_nondet_float() [L194] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L194] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L195] var_1_37 = __VERIFIER_nondet_uchar() [L196] CALL assume_abort_if_not(var_1_37 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L196] RET assume_abort_if_not(var_1_37 >= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L197] CALL assume_abort_if_not(var_1_37 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L197] RET assume_abort_if_not(var_1_37 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L214] RET updateVariables() [L215] CALL step() [L60] COND FALSE !((var_1_1 % ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28)))) > var_1_1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L63] COND TRUE var_1_32 < ((((var_1_30) > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) ? (var_1_30) : (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) [L64] var_1_33 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L70] var_1_38 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L72] var_1_40 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L78] COND FALSE !(((((1.000000095E7f) < 0 ) ? -(1.000000095E7f) : (1.000000095E7f))) < ((9.9999999999996E12f - var_1_31) / var_1_22)) [L83] var_1_42 = 100000u VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=10, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L85] var_1_44 = (((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) + (((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < 0 ) ? -((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) : ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L86] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=16, var_1_7=-256, var_1_8=-10, var_1_9=15] [L89] COND TRUE var_1_19 > ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) [L90] var_1_45 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=-10, var_1_9=15] [L95] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=-10, var_1_9=15] [L96] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=-10, var_1_9=15] [L97] COND FALSE !(var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) [L100] var_1_19 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=-10, var_1_9=15] [L105] unsigned long int stepLocal_1 = last_1_var_1_12; [L106] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=-10, var_1_9=15] [L107] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_1=8, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=-10, var_1_9=15] [L108] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=-10, var_1_9=15] [L109] COND FALSE !((var_1_4 - var_1_5) >= last_1_var_1_17) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=-10, var_1_9=15] [L116] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=-10, var_1_9=15] [L119] COND TRUE ! (var_1_17 > var_1_5) [L120] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=1, var_1_9=15] [L124] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=13, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=1, var_1_9=15] [L125] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L136] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=13, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=1, var_1_9=15] [L138] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_2=0, stepLocal_4=13, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=1, var_1_9=15] [L139] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=13, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=1, var_1_9=15] [L142] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=13, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=1, var_1_9=15] [L215] RET step() [L216] CALL, EXPR property() [L206-L207] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=1, var_1_9=15] [L216] RET, EXPR property() [L216] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=1, var_1_9=15] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=13, var_1_12=8, var_1_13=257, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=13, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=257, var_1_27=-128, var_1_28=-128, var_1_33=13, var_1_37=64, var_1_38=13, var_1_40=13, var_1_42=100000, var_1_44=77, var_1_45=13, var_1_7=-256, var_1_8=1, var_1_9=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 9, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1253 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1233 mSDsluCounter, 3133 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1989 mSDsCounter, 825 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 825 mSolverCounterUnsat, 1144 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1450 GetRequests, 1379 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=829occurred in iteration=8, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 202 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2483 NumberOfCodeBlocks, 2483 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2469 ConstructedInterpolants, 0 QuantifiedInterpolants, 7503 SizeOfPredicates, 4 NumberOfNonLiveVariables, 939 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 23580/23808 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:54:00,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fae3db68adc0ffe998fc93858a245ffb30205c57f234c7f9849920ee7dba257 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:54:02,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:54:02,720 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:54:02,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:54:02,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:54:02,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:54:02,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:54:02,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:54:02,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:54:02,750 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:54:02,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:54:02,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:54:02,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:54:02,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:54:02,752 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:54:02,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:54:02,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:54:02,752 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:54:02,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:54:02,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:54:02,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:54:02,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:54:02,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:54:02,753 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:54:02,753 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:54:02,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:54:02,753 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:54:02,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:54:02,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:54:02,753 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:54:02,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:54:02,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:54:02,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:54:02,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:54:02,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:54:02,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:54:02,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:54:02,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:54:02,755 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:54:02,755 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:54:02,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:54:02,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:54:02,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:54:02,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:54:02,755 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 -> 5fae3db68adc0ffe998fc93858a245ffb30205c57f234c7f9849920ee7dba257 [2024-11-07 06:54:02,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:54:03,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:54:03,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:54:03,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:54:03,006 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:54:03,007 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-51.i [2024-11-07 06:54:04,256 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:54:04,461 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:54:04,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i [2024-11-07 06:54:04,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e78d5dc68/76d6dc81337c4229be63644fa545cb66/FLAGdc80d7333 [2024-11-07 06:54:04,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e78d5dc68/76d6dc81337c4229be63644fa545cb66 [2024-11-07 06:54:04,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:54:04,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:54:04,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:54:04,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:54:04,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:54:04,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:54:04" (1/1) ... [2024-11-07 06:54:04,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72206b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:04, skipping insertion in model container [2024-11-07 06:54:04,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:54:04" (1/1) ... [2024-11-07 06:54:04,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:54:04,637 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-51.i[919,932] [2024-11-07 06:54:04,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:54:04,714 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:54:04,723 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-51.i[919,932] [2024-11-07 06:54:04,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:54:04,771 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:54:04,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:04 WrapperNode [2024-11-07 06:54:04,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:54:04,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:54:04,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:54:04,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:54:04,781 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:54:04" (1/1) ... [2024-11-07 06:54:04,795 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:54:04" (1/1) ... [2024-11-07 06:54:04,833 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-07 06:54:04,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:54:04,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:54:04,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:54:04,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:54:04,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:04" (1/1) ... [2024-11-07 06:54:04,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:04" (1/1) ... [2024-11-07 06:54:04,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:04" (1/1) ... [2024-11-07 06:54:04,867 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:54:04,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:04" (1/1) ... [2024-11-07 06:54:04,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:04" (1/1) ... [2024-11-07 06:54:04,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:04" (1/1) ... [2024-11-07 06:54:04,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:04" (1/1) ... [2024-11-07 06:54:04,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:04" (1/1) ... [2024-11-07 06:54:04,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:04" (1/1) ... [2024-11-07 06:54:04,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:54:04,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:54:04,903 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:54:04,903 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:54:04,904 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:04" (1/1) ... [2024-11-07 06:54:04,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:54:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:54:04,932 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:54:04,937 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:54:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:54:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:54:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:54:04,957 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:54:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:54:04,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:54:05,031 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:54:05,032 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:54:27,833 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 06:54:27,834 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:54:27,841 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:54:27,841 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 06:54:27,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:54:27 BoogieIcfgContainer [2024-11-07 06:54:27,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:54:27,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:54:27,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:54:27,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:54:27,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:54:04" (1/3) ... [2024-11-07 06:54:27,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fb7030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:54:27, skipping insertion in model container [2024-11-07 06:54:27,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:04" (2/3) ... [2024-11-07 06:54:27,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fb7030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:54:27, skipping insertion in model container [2024-11-07 06:54:27,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:54:27" (3/3) ... [2024-11-07 06:54:27,848 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i [2024-11-07 06:54:27,857 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:54:27,857 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:54:27,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:54:27,902 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;@290e0e64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:54:27,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:54:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 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:54:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 06:54:27,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:54:27,917 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:54:27,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:54:27,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:54:27,920 INFO L85 PathProgramCache]: Analyzing trace with hash 114399864, now seen corresponding path program 1 times [2024-11-07 06:54:27,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:54:27,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032320891] [2024-11-07 06:54:27,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:54:27,928 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:54:27,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:54:27,930 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:54:27,932 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:54:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:29,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:54:29,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:54:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2024-11-07 06:54:29,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:54:29,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:54:29,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032320891] [2024-11-07 06:54:29,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032320891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:54:29,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:54:29,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:54:29,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371731160] [2024-11-07 06:54:29,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:54:29,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:54:29,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:54:29,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:54:29,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:54:29,517 INFO L87 Difference]: Start difference. First operand has 96 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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:54:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:54:29,541 INFO L93 Difference]: Finished difference Result 184 states and 326 transitions. [2024-11-07 06:54:29,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:54:29,543 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 204 [2024-11-07 06:54:29,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:54:29,551 INFO L225 Difference]: With dead ends: 184 [2024-11-07 06:54:29,551 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 06:54:29,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 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:54:29,557 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:54:29,557 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:54:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 06:54:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 06:54:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 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:54:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2024-11-07 06:54:29,591 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 204 [2024-11-07 06:54:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:54:29,593 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2024-11-07 06:54:29,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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:54:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2024-11-07 06:54:29,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 06:54:29,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:54:29,597 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:54:29,636 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:54:29,798 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:54:29,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:54:29,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:54:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash -744616138, now seen corresponding path program 1 times [2024-11-07 06:54:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:54:29,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369511018] [2024-11-07 06:54:29,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:54:29,799 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:54:29,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:54:29,802 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:54:29,803 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:54:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:31,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:54:31,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:54:34,512 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:54:34,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:54:38,498 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:54:38,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:54:38,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369511018] [2024-11-07 06:54:38,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369511018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:54:38,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:54:38,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 06:54:38,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489573442] [2024-11-07 06:54:38,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:54:38,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:54:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:54:38,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:54:38,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:54:38,502 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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:54:46,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:54:49,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:54:54,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:54:58,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:55:02,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:55:02,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:55:02,395 INFO L93 Difference]: Finished difference Result 187 states and 284 transitions. [2024-11-07 06:55:02,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:55:02,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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 204 [2024-11-07 06:55:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:55:02,482 INFO L225 Difference]: With dead ends: 187 [2024-11-07 06:55:02,482 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 06:55:02,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:55:02,483 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 75 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 8 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:55:02,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 237 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 180 Invalid, 4 Unknown, 0 Unchecked, 23.3s Time] [2024-11-07 06:55:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 06:55:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-07 06:55:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 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:55:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2024-11-07 06:55:02,500 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 204 [2024-11-07 06:55:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:55:02,500 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2024-11-07 06:55:02,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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:55:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2024-11-07 06:55:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-07 06:55:02,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:55:02,504 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:55:02,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 06:55:02,704 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:55:02,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:55:02,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:55:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash 868501552, now seen corresponding path program 1 times [2024-11-07 06:55:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:55:02,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681409700] [2024-11-07 06:55:02,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:55:02,706 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:55:02,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:55:02,708 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:55:02,709 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:55:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:55:04,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 06:55:04,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:55:10,607 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:55:10,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:55:10,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:55:10,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681409700] [2024-11-07 06:55:10,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681409700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:55:10,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:55:10,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:55:10,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69917591] [2024-11-07 06:55:10,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:55:10,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:55:10,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:55:10,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:55:10,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:55:10,609 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 4 states, 4 states have (on average 12.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:55:15,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:55:19,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:55:23,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:55:25,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []