./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-21.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-pe-ci_file-21.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', 'f8673b4fe8d27b4daddd93c519b7df3f47169b3d20a89244cbb1455db6c7d41e'] 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-pe-ci_file-21.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 f8673b4fe8d27b4daddd93c519b7df3f47169b3d20a89244cbb1455db6c7d41e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:43:38,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:43:39,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:43:39,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:43:39,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:43:39,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:43:39,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:43:39,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:43:39,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:43:39,099 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:43:39,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:43:39,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:43:39,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:43:39,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:43:39,100 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:43:39,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:43:39,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:43:39,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:43:39,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:43:39,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:43:39,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:43:39,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:43:39,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:43:39,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:43:39,101 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:43:39,101 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:43:39,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:43:39,101 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:43:39,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:43:39,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:43:39,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:43:39,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:43:39,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:43:39,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:43:39,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:43:39,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:43:39,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:43:39,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:43:39,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:43:39,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:43:39,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:43:39,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:43:39,103 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 -> f8673b4fe8d27b4daddd93c519b7df3f47169b3d20a89244cbb1455db6c7d41e [2024-11-07 05:43:39,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:43:39,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:43:39,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:43:39,369 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:43:39,369 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:43:39,370 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-pe-ci_file-21.i [2024-11-07 05:43:40,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:43:40,971 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:43:40,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-21.i [2024-11-07 05:43:40,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/069a696f6/1bf30016d6d34a388d23eeeec6da8caf/FLAG26955460e [2024-11-07 05:43:40,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/069a696f6/1bf30016d6d34a388d23eeeec6da8caf [2024-11-07 05:43:40,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:43:40,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:43:40,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:43:40,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:43:41,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:43:41,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:43:40" (1/1) ... [2024-11-07 05:43:41,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc5a444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41, skipping insertion in model container [2024-11-07 05:43:41,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:43:40" (1/1) ... [2024-11-07 05:43:41,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:43:41,127 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-pe-ci_file-21.i[919,932] [2024-11-07 05:43:41,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:43:41,224 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:43:41,232 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-pe-ci_file-21.i[919,932] [2024-11-07 05:43:41,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:43:41,277 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:43:41,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41 WrapperNode [2024-11-07 05:43:41,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:43:41,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:43:41,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:43:41,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:43:41,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41" (1/1) ... [2024-11-07 05:43:41,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41" (1/1) ... [2024-11-07 05:43:41,367 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 267 [2024-11-07 05:43:41,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:43:41,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:43:41,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:43:41,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:43:41,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41" (1/1) ... [2024-11-07 05:43:41,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41" (1/1) ... [2024-11-07 05:43:41,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41" (1/1) ... [2024-11-07 05:43:41,419 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 05:43:41,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41" (1/1) ... [2024-11-07 05:43:41,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41" (1/1) ... [2024-11-07 05:43:41,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41" (1/1) ... [2024-11-07 05:43:41,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41" (1/1) ... [2024-11-07 05:43:41,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41" (1/1) ... [2024-11-07 05:43:41,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41" (1/1) ... [2024-11-07 05:43:41,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:43:41,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:43:41,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:43:41,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:43:41,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41" (1/1) ... [2024-11-07 05:43:41,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:43:41,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:43:41,484 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 05:43:41,490 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 05:43:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:43:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:43:41,509 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:43:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:43:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:43:41,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:43:41,621 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:43:41,623 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:43:42,176 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-07 05:43:42,176 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:43:42,190 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:43:42,190 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:43:42,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:43:42 BoogieIcfgContainer [2024-11-07 05:43:42,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:43:42,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:43:42,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:43:42,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:43:42,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:43:40" (1/3) ... [2024-11-07 05:43:42,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7c60ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:43:42, skipping insertion in model container [2024-11-07 05:43:42,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:41" (2/3) ... [2024-11-07 05:43:42,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7c60ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:43:42, skipping insertion in model container [2024-11-07 05:43:42,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:43:42" (3/3) ... [2024-11-07 05:43:42,201 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-21.i [2024-11-07 05:43:42,215 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:43:42,215 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:43:42,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:43:42,271 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;@1e3bcefd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:43:42,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:43:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 80 states have internal predecessors, (116), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 05:43:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-07 05:43:42,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:42,289 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:43:42,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:42,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:42,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1609780857, now seen corresponding path program 1 times [2024-11-07 05:43:42,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:43:42,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858214836] [2024-11-07 05:43:42,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:42,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:43:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:43:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:43:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:43:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:43:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:43:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:43:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:43:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:43:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:43:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:43:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:43:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:43:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:43:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:43:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:43:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:43:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:43:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:43:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:43:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:43:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:43:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:43:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:43:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:43:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:43:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:43:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:43:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:43:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 05:43:43,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:43:43,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858214836] [2024-11-07 05:43:43,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858214836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:43:43,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:43:43,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:43:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888694399] [2024-11-07 05:43:43,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:43:43,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:43:43,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:43:43,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:43:43,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:43:43,665 INFO L87 Difference]: Start difference. First operand has 110 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 80 states have internal predecessors, (116), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 05:43:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:43:44,067 INFO L93 Difference]: Finished difference Result 317 states and 563 transitions. [2024-11-07 05:43:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:43:44,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-11-07 05:43:44,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:43:44,081 INFO L225 Difference]: With dead ends: 317 [2024-11-07 05:43:44,081 INFO L226 Difference]: Without dead ends: 210 [2024-11-07 05:43:44,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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 05:43:44,089 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 114 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:43:44,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 453 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:43:44,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-07 05:43:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 157. [2024-11-07 05:43:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 98 states have (on average 1.336734693877551) internal successors, (131), 98 states have internal predecessors, (131), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 05:43:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 243 transitions. [2024-11-07 05:43:44,173 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 243 transitions. Word has length 185 [2024-11-07 05:43:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:43:44,174 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 243 transitions. [2024-11-07 05:43:44,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 05:43:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 243 transitions. [2024-11-07 05:43:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-07 05:43:44,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:44,179 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:43:44,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:43:44,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:44,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1475767351, now seen corresponding path program 1 times [2024-11-07 05:43:44,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:43:44,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037392370] [2024-11-07 05:43:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:43:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:43:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:43:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:43:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:43:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:43:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:43:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:43:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:43:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:43:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:43:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:43:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:43:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:43:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:43:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:43:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:43:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:43:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:43:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:43:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:43:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:43:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:43:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:43:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:43:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:43:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:43:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:43:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:43:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 05:43:47,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:43:47,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037392370] [2024-11-07 05:43:47,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037392370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:43:47,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:43:47,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 05:43:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623205049] [2024-11-07 05:43:47,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:43:47,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 05:43:47,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:43:47,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 05:43:47,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 05:43:47,107 INFO L87 Difference]: Start difference. First operand 157 states and 243 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 05:43:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:43:47,731 INFO L93 Difference]: Finished difference Result 382 states and 592 transitions. [2024-11-07 05:43:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 05:43:47,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-11-07 05:43:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:43:47,735 INFO L225 Difference]: With dead ends: 382 [2024-11-07 05:43:47,735 INFO L226 Difference]: Without dead ends: 279 [2024-11-07 05:43:47,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:43:47,737 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 226 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 05:43:47,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 549 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 05:43:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-07 05:43:47,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2024-11-07 05:43:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 194 states have (on average 1.4639175257731958) internal successors, (284), 195 states have internal predecessors, (284), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 05:43:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 412 transitions. [2024-11-07 05:43:47,787 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 412 transitions. Word has length 185 [2024-11-07 05:43:47,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:43:47,788 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 412 transitions. [2024-11-07 05:43:47,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 05:43:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 412 transitions. [2024-11-07 05:43:47,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-07 05:43:47,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:47,795 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:43:47,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:43:47,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:47,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:47,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2001551495, now seen corresponding path program 1 times [2024-11-07 05:43:47,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:43:47,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616420464] [2024-11-07 05:43:47,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:47,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:43:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:43:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:43:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:43:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:43:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:43:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:43:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:43:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:43:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:43:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:43:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:43:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:43:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:43:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:43:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:43:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:43:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:43:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:43:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:43:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:43:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:43:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:43:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:43:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:43:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:43:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:43:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:43:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:43:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 05:43:47,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:43:47,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616420464] [2024-11-07 05:43:47,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616420464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:43:47,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:43:47,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:43:47,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605740512] [2024-11-07 05:43:47,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:43:47,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:43:47,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:43:47,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:43:47,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:43:47,981 INFO L87 Difference]: Start difference. First operand 263 states and 412 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 05:43:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:43:48,013 INFO L93 Difference]: Finished difference Result 435 states and 679 transitions. [2024-11-07 05:43:48,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:43:48,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-11-07 05:43:48,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:43:48,017 INFO L225 Difference]: With dead ends: 435 [2024-11-07 05:43:48,017 INFO L226 Difference]: Without dead ends: 226 [2024-11-07 05:43:48,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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 05:43:48,019 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:43:48,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:43:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-07 05:43:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-11-07 05:43:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 157 states have (on average 1.3885350318471337) internal successors, (218), 158 states have internal predecessors, (218), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 05:43:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 346 transitions. [2024-11-07 05:43:48,049 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 346 transitions. Word has length 185 [2024-11-07 05:43:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:43:48,051 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 346 transitions. [2024-11-07 05:43:48,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 05:43:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 346 transitions. [2024-11-07 05:43:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-07 05:43:48,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:48,054 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:43:48,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:43:48,054 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:48,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:48,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1256912633, now seen corresponding path program 1 times [2024-11-07 05:43:48,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:43:48,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967057792] [2024-11-07 05:43:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:48,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:43:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:43:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:43:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:43:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:43:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:43:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:43:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:43:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:43:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:43:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:43:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:43:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:43:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:43:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:43:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:43:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:43:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:43:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:43:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:43:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:43:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:43:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:43:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:43:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:43:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:43:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:43:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:43:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:43:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 05:43:48,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:43:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967057792] [2024-11-07 05:43:48,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967057792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:43:48,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:43:48,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:43:48,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942865597] [2024-11-07 05:43:48,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:43:48,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:43:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:43:48,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:43:48,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:43:48,185 INFO L87 Difference]: Start difference. First operand 226 states and 346 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 05:43:48,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:43:48,222 INFO L93 Difference]: Finished difference Result 337 states and 512 transitions. [2024-11-07 05:43:48,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:43:48,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-11-07 05:43:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:43:48,224 INFO L225 Difference]: With dead ends: 337 [2024-11-07 05:43:48,224 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 05:43:48,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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 05:43:48,226 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:43:48,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:43:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 05:43:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-07 05:43:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 104 states have internal predecessors, (134), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 05:43:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2024-11-07 05:43:48,249 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 185 [2024-11-07 05:43:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:43:48,250 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2024-11-07 05:43:48,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 05:43:48,250 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2024-11-07 05:43:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-07 05:43:48,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:48,253 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:43:48,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:43:48,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:48,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:48,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1041628762, now seen corresponding path program 1 times [2024-11-07 05:43:48,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:43:48,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228679076] [2024-11-07 05:43:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:48,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:43:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:43:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:43:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:43:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:43:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:43:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:43:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:43:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:43:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:43:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:43:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:43:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:43:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:43:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:43:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:43:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:43:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:43:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:43:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:43:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:43:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:43:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:43:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:43:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:43:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:43:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:43:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:43:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:43:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 05:43:48,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:43:48,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228679076] [2024-11-07 05:43:48,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228679076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:43:48,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959880056] [2024-11-07 05:43:48,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:48,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:43:48,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:43:48,593 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 05:43:48,595 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 05:43:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:48,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 05:43:48,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:43:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 543 proven. 63 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-07 05:43:48,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:43:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 05:43:49,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959880056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:43:49,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:43:49,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-07 05:43:49,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893761789] [2024-11-07 05:43:49,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:43:49,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:43:49,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:43:49,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:43:49,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:43:49,238 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-07 05:43:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:43:49,482 INFO L93 Difference]: Finished difference Result 288 states and 421 transitions. [2024-11-07 05:43:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:43:49,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 187 [2024-11-07 05:43:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:43:49,485 INFO L225 Difference]: With dead ends: 288 [2024-11-07 05:43:49,485 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 05:43:49,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-07 05:43:49,489 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 79 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:43:49,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 304 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:43:49,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 05:43:49,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2024-11-07 05:43:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 110 states have (on average 1.2545454545454546) internal successors, (138), 110 states have internal predecessors, (138), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 05:43:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2024-11-07 05:43:49,522 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 187 [2024-11-07 05:43:49,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:43:49,524 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2024-11-07 05:43:49,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-07 05:43:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2024-11-07 05:43:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 05:43:49,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:49,527 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:43:49,546 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 05:43:49,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:43:49,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:49,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1124561079, now seen corresponding path program 1 times [2024-11-07 05:43:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:43:49,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302759920] [2024-11-07 05:43:49,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:49,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:43:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:49,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:43:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:49,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:43:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:49,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:43:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:49,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:43:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:49,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:43:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:49,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:43:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:43:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:43:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:43:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:43:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:43:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:43:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:43:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:43:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:43:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:43:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:43:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:43:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:43:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:43:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:43:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:43:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:43:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:43:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:43:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:43:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:43:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:43:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 05:43:50,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:43:50,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302759920] [2024-11-07 05:43:50,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302759920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:43:50,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919784699] [2024-11-07 05:43:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:50,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:43:50,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:43:50,118 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 05:43:50,120 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 05:43:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:50,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 05:43:50,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:43:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 827 proven. 51 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-07 05:43:50,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:43:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 05:43:51,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919784699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:43:51,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:43:51,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-07 05:43:51,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245701732] [2024-11-07 05:43:51,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:43:51,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 05:43:51,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:43:51,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 05:43:51,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-07 05:43:51,123 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 6 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2024-11-07 05:43:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:43:51,450 INFO L93 Difference]: Finished difference Result 300 states and 426 transitions. [2024-11-07 05:43:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 05:43:51,452 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 6 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) Word has length 189 [2024-11-07 05:43:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:43:51,454 INFO L225 Difference]: With dead ends: 300 [2024-11-07 05:43:51,454 INFO L226 Difference]: Without dead ends: 185 [2024-11-07 05:43:51,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2024-11-07 05:43:51,456 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 378 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:43:51,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 271 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:43:51,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-07 05:43:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2024-11-07 05:43:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 116 states have (on average 1.2241379310344827) internal successors, (142), 116 states have internal predecessors, (142), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 05:43:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 254 transitions. [2024-11-07 05:43:51,496 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 254 transitions. Word has length 189 [2024-11-07 05:43:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:43:51,499 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 254 transitions. [2024-11-07 05:43:51,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 6 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2024-11-07 05:43:51,500 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 254 transitions. [2024-11-07 05:43:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 05:43:51,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:51,502 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:43:51,524 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 05:43:51,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:43:51,703 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:51,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:51,704 INFO L85 PathProgramCache]: Analyzing trace with hash -693060584, now seen corresponding path program 1 times [2024-11-07 05:43:51,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:43:51,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100630140] [2024-11-07 05:43:51,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:51,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:43:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:43:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:43:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:43:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:43:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:43:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:43:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:43:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:43:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:43:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:43:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:43:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:43:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:43:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:43:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:43:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:43:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:43:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:43:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:43:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:43:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:43:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:43:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:43:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:43:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:43:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:43:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:43:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:43:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 05:43:52,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:43:52,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100630140] [2024-11-07 05:43:52,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100630140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:43:52,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386007753] [2024-11-07 05:43:52,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:52,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:43:52,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:43:52,132 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 05:43:52,135 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 05:43:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 05:43:52,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:43:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 802 proven. 195 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-07 05:43:53,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:43:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 05:43:54,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386007753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:43:54,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:43:54,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 18, 7] total 25 [2024-11-07 05:43:54,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102312220] [2024-11-07 05:43:54,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:43:54,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 05:43:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:43:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 05:43:54,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2024-11-07 05:43:54,182 INFO L87 Difference]: Start difference. First operand 181 states and 254 transitions. Second operand has 25 states, 25 states have (on average 5.48) internal successors, (137), 23 states have internal predecessors, (137), 7 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (62), 7 states have call predecessors, (62), 7 states have call successors, (62) [2024-11-07 05:43:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:43:55,147 INFO L93 Difference]: Finished difference Result 414 states and 556 transitions. [2024-11-07 05:43:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-07 05:43:55,148 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.48) internal successors, (137), 23 states have internal predecessors, (137), 7 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (62), 7 states have call predecessors, (62), 7 states have call successors, (62) Word has length 190 [2024-11-07 05:43:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:43:55,150 INFO L225 Difference]: With dead ends: 414 [2024-11-07 05:43:55,150 INFO L226 Difference]: Without dead ends: 295 [2024-11-07 05:43:55,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=404, Invalid=1236, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 05:43:55,155 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 474 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:43:55,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 741 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 05:43:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-07 05:43:55,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 277. [2024-11-07 05:43:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 192 states have (on average 1.2239583333333333) internal successors, (235), 193 states have internal predecessors, (235), 66 states have call successors, (66), 18 states have call predecessors, (66), 18 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 05:43:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 367 transitions. [2024-11-07 05:43:55,195 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 367 transitions. Word has length 190 [2024-11-07 05:43:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:43:55,196 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 367 transitions. [2024-11-07 05:43:55,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.48) internal successors, (137), 23 states have internal predecessors, (137), 7 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (62), 7 states have call predecessors, (62), 7 states have call successors, (62) [2024-11-07 05:43:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 367 transitions. [2024-11-07 05:43:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 05:43:55,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:55,199 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:43:55,217 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 05:43:55,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:43:55,404 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:55,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:55,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1682221452, now seen corresponding path program 1 times [2024-11-07 05:43:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:43:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272499484] [2024-11-07 05:43:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:43:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:43:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:43:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:43:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:43:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:43:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:43:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:43:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:43:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:43:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:43:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:43:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:43:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:43:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:43:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:43:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:43:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:43:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:43:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:43:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:43:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:43:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:43:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:43:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:43:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:43:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:43:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:43:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:43:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 05:43:55,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:43:55,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272499484] [2024-11-07 05:43:55,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272499484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:43:55,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:43:55,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:43:55,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891746497] [2024-11-07 05:43:55,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:43:55,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:43:55,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:43:55,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:43:55,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:43:55,683 INFO L87 Difference]: Start difference. First operand 277 states and 367 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 05:43:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:43:55,912 INFO L93 Difference]: Finished difference Result 750 states and 980 transitions. [2024-11-07 05:43:55,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:43:55,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2024-11-07 05:43:55,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:43:55,916 INFO L225 Difference]: With dead ends: 750 [2024-11-07 05:43:55,916 INFO L226 Difference]: Without dead ends: 547 [2024-11-07 05:43:55,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:43:55,918 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 248 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:43:55,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 351 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:43:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-07 05:43:55,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 360. [2024-11-07 05:43:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 274 states have (on average 1.313868613138686) internal successors, (360), 275 states have internal predecessors, (360), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 05:43:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 492 transitions. [2024-11-07 05:43:55,974 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 492 transitions. Word has length 191 [2024-11-07 05:43:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:43:55,974 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 492 transitions. [2024-11-07 05:43:55,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 05:43:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 492 transitions. [2024-11-07 05:43:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 05:43:55,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:55,976 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:43:55,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 05:43:55,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:55,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:55,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1932687474, now seen corresponding path program 1 times [2024-11-07 05:43:55,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:43:55,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021352000] [2024-11-07 05:43:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:55,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:43:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:43:56,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354404385] [2024-11-07 05:43:56,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:56,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:43:56,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:43:56,051 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:43:56,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 05:43:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:43:56,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:43:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:43:56,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:43:56,452 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:43:56,452 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:43:56,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 05:43:56,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-07 05:43:56,657 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:43:56,806 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:43:56,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:43:56 BoogieIcfgContainer [2024-11-07 05:43:56,811 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:43:56,812 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:43:56,812 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:43:56,812 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:43:56,813 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:43:42" (3/4) ... [2024-11-07 05:43:56,815 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:43:56,816 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:43:56,817 INFO L158 Benchmark]: Toolchain (without parser) took 15821.01ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 91.1MB in the beginning and 111.5MB in the end (delta: -20.4MB). Peak memory consumption was 144.8MB. Max. memory is 16.1GB. [2024-11-07 05:43:56,818 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:43:56,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.50ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 74.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:43:56,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.87ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 69.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:43:56,818 INFO L158 Benchmark]: Boogie Preprocessor took 83.29ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 62.6MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:43:56,819 INFO L158 Benchmark]: RCFGBuilder took 738.23ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 74.7MB in the end (delta: -12.3MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2024-11-07 05:43:56,819 INFO L158 Benchmark]: TraceAbstraction took 14617.90ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 74.3MB in the beginning and 111.6MB in the end (delta: -37.3MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. [2024-11-07 05:43:56,820 INFO L158 Benchmark]: Witness Printer took 4.91ms. Allocated memory is still 285.2MB. Free memory was 111.6MB in the beginning and 111.5MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:43:56,821 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.19ms. Allocated memory is still 117.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.50ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 74.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.87ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 69.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.29ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 62.6MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 738.23ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 74.7MB in the end (delta: -12.3MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14617.90ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 74.3MB in the beginning and 111.6MB in the end (delta: -37.3MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. * Witness Printer took 4.91ms. Allocated memory is still 285.2MB. Free memory was 111.6MB in the beginning and 111.5MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryArithmeticDOUBLEoperation at line 110, overapproximation of bitwiseAnd at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 10; [L23] signed char var_1_3 = 1; [L24] signed char var_1_4 = 100; [L25] signed char var_1_5 = 5; [L26] signed char var_1_6 = 32; [L27] signed char var_1_7 = 32; [L28] unsigned short int var_1_8 = 8; [L29] unsigned short int var_1_10 = 21451; [L30] unsigned char var_1_12 = 8; [L31] unsigned short int var_1_13 = 16; [L32] unsigned short int var_1_16 = 53444; [L33] unsigned char var_1_17 = 0; [L34] unsigned char var_1_18 = 0; [L35] double var_1_19 = 1.2; [L36] signed char var_1_20 = 1; [L37] double var_1_21 = 10.5; [L38] double var_1_22 = 0.0; [L39] double var_1_23 = 10.4; [L40] double var_1_24 = 50.5; [L41] unsigned short int var_1_25 = 2; [L42] signed long int var_1_26 = 500; [L43] float var_1_31 = 99.375; [L44] unsigned char var_1_34 = 8; [L45] signed long int var_1_36 = 1; [L46] double var_1_37 = 100.5; [L47] unsigned char var_1_40 = 0; [L48] unsigned char var_1_41 = 1; [L49] unsigned char var_1_42 = 1; [L50] unsigned char var_1_43 = 1; [L51] unsigned short int var_1_44 = 0; [L52] double var_1_46 = 1.75; [L53] unsigned short int last_1_var_1_8 = 8; [L54] unsigned char last_1_var_1_12 = 8; [L55] unsigned short int last_1_var_1_13 = 16; [L56] unsigned char last_1_var_1_17 = 0; [L57] unsigned short int last_1_var_1_25 = 2; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=1, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L187] isInitial = 1 [L188] FCALL initially() [L189] COND TRUE 1 [L190] CALL updateLastVariables() [L176] last_1_var_1_8 = var_1_8 [L177] last_1_var_1_12 = var_1_12 [L178] last_1_var_1_13 = var_1_13 [L179] last_1_var_1_17 = var_1_17 [L180] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=1, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L190] RET updateLastVariables() [L191] CALL updateVariables() [L130] var_1_3 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_3 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L131] RET assume_abort_if_not(var_1_3 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L132] CALL assume_abort_if_not(var_1_3 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L132] RET assume_abort_if_not(var_1_3 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L133] var_1_4 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L134] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L135] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L135] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L136] var_1_5 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=32, var_1_7=32, var_1_8=8] [L137] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=32, var_1_7=32, var_1_8=8] [L138] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=32, var_1_7=32, var_1_8=8] [L138] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=32, var_1_7=32, var_1_8=8] [L139] var_1_6 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=32, var_1_8=8] [L140] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=32, var_1_8=8] [L141] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=32, var_1_8=8] [L141] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=32, var_1_8=8] [L142] var_1_7 = __VERIFIER_nondet_char() [L143] 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_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L143] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L144] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L144] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L145] var_1_10 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_10 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L146] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L147] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L147] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L148] var_1_16 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L149] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L150] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L150] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L151] var_1_18 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L152] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L153] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L153] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L154] var_1_20 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L156] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L156] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L157] var_1_21 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L158] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L159] var_1_22 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L160] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L161] var_1_23 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L162] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L163] var_1_24 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L164] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L165] var_1_41 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_41 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L166] RET assume_abort_if_not(var_1_41 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L167] CALL assume_abort_if_not(var_1_41 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L167] RET assume_abort_if_not(var_1_41 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L168] var_1_42 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_42 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L169] RET assume_abort_if_not(var_1_42 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L170] CALL assume_abort_if_not(var_1_42 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L170] RET assume_abort_if_not(var_1_42 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L171] var_1_43 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_43 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L172] RET assume_abort_if_not(var_1_43 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L173] CALL assume_abort_if_not(var_1_43 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L173] RET assume_abort_if_not(var_1_43 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L191] RET updateVariables() [L192] CALL step() [L61] COND TRUE (last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17 [L62] var_1_25 = (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L66] signed long int stepLocal_1 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_1=16, var_1_10=98303, var_1_12=8, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L67] COND TRUE last_1_var_1_13 == stepLocal_1 [L68] var_1_12 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=1, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=8] [L70] var_1_8 = (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12)) [L71] signed long int stepLocal_0 = -1000000; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_0=-1000000, var_1_10=98303, var_1_12=1, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L72] COND TRUE var_1_8 >= stepLocal_0 [L73] var_1_1 = ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=1, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L77] signed char stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_3=0, var_1_10=98303, var_1_12=1, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L78] COND TRUE stepLocal_3 >= (var_1_5 - var_1_20) [L79] var_1_19 = (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=1, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L81] COND TRUE ((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25) [L82] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=1, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L84] unsigned short int stepLocal_2 = var_1_25; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=9, var_1_10=98303, var_1_12=1, var_1_13=16, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L85] COND FALSE !(\read(var_1_17)) [L92] var_1_13 = (var_1_16 - var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=9, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L94] COND FALSE !(var_1_17 && (var_1_5 > (var_1_7 / var_1_10))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=9, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L99] COND TRUE var_1_5 < var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=9, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L100] COND FALSE !(var_1_5 <= var_1_12) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=9, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L108] var_1_34 = var_1_7 [L109] var_1_36 = var_1_12 [L110] var_1_37 = (var_1_23 + var_1_23) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=9, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=1, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L111] COND TRUE var_1_21 < var_1_24 [L112] var_1_40 = (! ((var_1_41 && var_1_42) && var_1_43)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=9, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=1, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L114] EXPR 25 & var_1_6 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=9, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=1, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L114] COND FALSE !((25 & var_1_6) < (var_1_12 - 25)) [L119] EXPR var_1_13 ^ var_1_16 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=9, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=1, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L119] COND TRUE 5u < (var_1_13 ^ var_1_16) [L120] COND FALSE !(\read(var_1_18)) [L123] var_1_46 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=9, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_23=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=1, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L192] RET step() [L193] CALL, EXPR property() [L183] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_23=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=1, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L183] EXPR var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_23=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=1, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L183] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_23=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=1, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L183-L184] return (((((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))))) && ((((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25)) ? (var_1_17 == ((unsigned char) var_1_18)) : 1)) && ((var_1_1 >= (var_1_5 - var_1_20)) ? (var_1_19 == ((double) (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24))) : 1)) && (((last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17) ? (var_1_25 == ((unsigned short int) (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7))) : (var_1_25 == ((unsigned short int) var_1_7))) ; [L193] RET, EXPR property() [L193] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_23=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=1, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=98303, var_1_12=1, var_1_13=0, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=2, var_1_23=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=1, var_1_3=3, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=2, var_1_6=63, var_1_7=1, var_1_8=32831] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1547 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1519 mSDsluCounter, 3306 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2178 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1584 IncrementalHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 1128 mSDtfsCounter, 1584 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1639 GetRequests, 1565 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=360occurred in iteration=8, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 282 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 2445 NumberOfCodeBlocks, 2445 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2615 ConstructedInterpolants, 0 QuantifiedInterpolants, 10188 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1363 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 20541/21168 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 05:43:56,860 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-pe-ci_file-21.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 f8673b4fe8d27b4daddd93c519b7df3f47169b3d20a89244cbb1455db6c7d41e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:43:59,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:43:59,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 05:43:59,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:43:59,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:43:59,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:43:59,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:43:59,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:43:59,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:43:59,238 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:43:59,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:43:59,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:43:59,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:43:59,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:43:59,239 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:43:59,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:43:59,240 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:43:59,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:43:59,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:43:59,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:43:59,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:43:59,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:43:59,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:43:59,241 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:43:59,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:43:59,241 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:43:59,241 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:43:59,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:43:59,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:43:59,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:43:59,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:43:59,242 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 -> f8673b4fe8d27b4daddd93c519b7df3f47169b3d20a89244cbb1455db6c7d41e [2024-11-07 05:43:59,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:43:59,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:43:59,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:43:59,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:43:59,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:43:59,541 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-pe-ci_file-21.i [2024-11-07 05:44:00,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:44:01,191 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:44:01,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-21.i [2024-11-07 05:44:01,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31bd7c6bf/d71853278e9942e8ac38f24177f5c665/FLAGd75bfa8f7 [2024-11-07 05:44:01,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31bd7c6bf/d71853278e9942e8ac38f24177f5c665 [2024-11-07 05:44:01,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:44:01,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:44:01,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:44:01,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:44:01,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:44:01,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e58eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01, skipping insertion in model container [2024-11-07 05:44:01,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:44:01,391 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-pe-ci_file-21.i[919,932] [2024-11-07 05:44:01,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:44:01,488 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:44:01,501 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-pe-ci_file-21.i[919,932] [2024-11-07 05:44:01,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:44:01,582 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:44:01,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01 WrapperNode [2024-11-07 05:44:01,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:44:01,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:44:01,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:44:01,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:44:01,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,645 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-07 05:44:01,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:44:01,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:44:01,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:44:01,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:44:01,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,683 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 05:44:01,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:44:01,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:44:01,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:44:01,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:44:01,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01" (1/1) ... [2024-11-07 05:44:01,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:44:01,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:44:01,765 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 05:44:01,770 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 05:44:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:44:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:44:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:44:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:44:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:44:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:44:01,888 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:44:01,889 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:44:03,533 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 05:44:03,533 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:44:03,546 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:44:03,547 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:44:03,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:44:03 BoogieIcfgContainer [2024-11-07 05:44:03,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:44:03,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:44:03,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:44:03,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:44:03,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:44:01" (1/3) ... [2024-11-07 05:44:03,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21eb5099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:44:03, skipping insertion in model container [2024-11-07 05:44:03,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:01" (2/3) ... [2024-11-07 05:44:03,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21eb5099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:44:03, skipping insertion in model container [2024-11-07 05:44:03,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:44:03" (3/3) ... [2024-11-07 05:44:03,561 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-21.i [2024-11-07 05:44:03,593 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:44:03,593 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:44:03,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:44:03,661 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;@8d453de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:44:03,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:44:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 05:44:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-07 05:44:03,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:03,683 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:03,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:03,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash 123240576, now seen corresponding path program 1 times [2024-11-07 05:44:03,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:44:03,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472637345] [2024-11-07 05:44:03,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:03,700 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 05:44:03,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:44:03,704 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 05:44:03,706 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 05:44:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:04,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:44:04,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-07 05:44:04,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:44:04,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:44:04,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472637345] [2024-11-07 05:44:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472637345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:44:04,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:44:04,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:44:04,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23860502] [2024-11-07 05:44:04,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:44:04,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:44:04,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:44:04,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:44:04,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:44:04,155 INFO L87 Difference]: Start difference. First operand has 86 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 05:44:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:04,188 INFO L93 Difference]: Finished difference Result 165 states and 290 transitions. [2024-11-07 05:44:04,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:44:04,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2024-11-07 05:44:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:04,198 INFO L225 Difference]: With dead ends: 165 [2024-11-07 05:44:04,199 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 05:44:04,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 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 05:44:04,206 INFO L432 NwaCegarLoop]: 127 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, 127 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 05:44:04,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:44:04,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 05:44:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 05:44:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 05:44:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-11-07 05:44:04,252 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 181 [2024-11-07 05:44:04,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:04,253 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-11-07 05:44:04,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 05:44:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2024-11-07 05:44:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-07 05:44:04,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:04,259 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:04,274 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 05:44:04,460 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 05:44:04,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:04,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1967718520, now seen corresponding path program 1 times [2024-11-07 05:44:04,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:44:04,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391640859] [2024-11-07 05:44:04,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:04,462 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 05:44:04,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:44:04,467 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 05:44:04,468 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 05:44:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:04,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 05:44:04,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 05:44:06,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:44:06,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:44:06,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391640859] [2024-11-07 05:44:06,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391640859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:44:06,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:44:06,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:44:06,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394697084] [2024-11-07 05:44:06,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:44:06,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:44:06,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:44:06,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:44:06,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:44:06,234 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 05:44:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:07,914 INFO L93 Difference]: Finished difference Result 241 states and 376 transitions. [2024-11-07 05:44:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:44:07,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2024-11-07 05:44:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:07,941 INFO L225 Difference]: With dead ends: 241 [2024-11-07 05:44:07,941 INFO L226 Difference]: Without dead ends: 162 [2024-11-07 05:44:07,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 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 05:44:07,942 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 73 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:07,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 346 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 05:44:07,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-07 05:44:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 133. [2024-11-07 05:44:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 05:44:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 205 transitions. [2024-11-07 05:44:07,972 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 205 transitions. Word has length 181 [2024-11-07 05:44:07,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:07,972 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 205 transitions. [2024-11-07 05:44:07,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 05:44:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 205 transitions. [2024-11-07 05:44:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-07 05:44:07,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:07,978 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:07,993 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 05:44:08,178 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 05:44:08,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:08,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:08,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1150070070, now seen corresponding path program 1 times [2024-11-07 05:44:08,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:44:08,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002516173] [2024-11-07 05:44:08,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:08,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:44:08,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:44:08,183 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 05:44:08,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 05:44:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:08,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 05:44:08,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 746 proven. 96 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2024-11-07 05:44:09,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:44:09,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:44:09,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002516173] [2024-11-07 05:44:09,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002516173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:44:09,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1408083159] [2024-11-07 05:44:09,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:09,519 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 05:44:09,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 05:44:09,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 05:44:09,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-07 05:44:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:10,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 05:44:10,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 727 proven. 51 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2024-11-07 05:44:10,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:44:10,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1408083159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:44:10,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:44:10,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2024-11-07 05:44:10,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620725706] [2024-11-07 05:44:10,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:44:10,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:44:10,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:44:10,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:44:10,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:44:10,962 INFO L87 Difference]: Start difference. First operand 133 states and 205 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-11-07 05:44:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:12,539 INFO L93 Difference]: Finished difference Result 232 states and 345 transitions. [2024-11-07 05:44:12,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 05:44:12,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 181 [2024-11-07 05:44:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:12,558 INFO L225 Difference]: With dead ends: 232 [2024-11-07 05:44:12,558 INFO L226 Difference]: Without dead ends: 153 [2024-11-07 05:44:12,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:44:12,561 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 96 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:12,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 262 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 05:44:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-07 05:44:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2024-11-07 05:44:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 86 states have (on average 1.197674418604651) internal successors, (103), 86 states have internal predecessors, (103), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 05:44:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 215 transitions. [2024-11-07 05:44:12,600 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 215 transitions. Word has length 181 [2024-11-07 05:44:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:12,601 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 215 transitions. [2024-11-07 05:44:12,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-11-07 05:44:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 215 transitions. [2024-11-07 05:44:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 05:44:12,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:12,606 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:12,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 05:44:12,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-07 05:44:13,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 05:44:13,008 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:13,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2028865830, now seen corresponding path program 1 times [2024-11-07 05:44:13,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:44:13,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054823105] [2024-11-07 05:44:13,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:13,009 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 05:44:13,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:44:13,011 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:44:13,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 05:44:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:13,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 05:44:13,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 767 proven. 135 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-07 05:44:14,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:44:14,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:44:14,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054823105] [2024-11-07 05:44:14,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054823105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:44:14,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1887023737] [2024-11-07 05:44:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:14,742 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 05:44:14,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 05:44:14,748 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 05:44:14,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-07 05:44:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:16,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 05:44:16,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 767 proven. 135 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-07 05:44:16,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:44:17,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1887023737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:44:17,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:44:17,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2024-11-07 05:44:17,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320911599] [2024-11-07 05:44:17,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:44:17,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 05:44:17,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:44:17,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 05:44:17,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-07 05:44:17,117 INFO L87 Difference]: Start difference. First operand 149 states and 215 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-07 05:44:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:19,514 INFO L93 Difference]: Finished difference Result 298 states and 421 transitions. [2024-11-07 05:44:19,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 05:44:19,514 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 182 [2024-11-07 05:44:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:19,517 INFO L225 Difference]: With dead ends: 298 [2024-11-07 05:44:19,517 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 05:44:19,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2024-11-07 05:44:19,518 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 174 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:19,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 507 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 05:44:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 05:44:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2024-11-07 05:44:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 117 states have (on average 1.2222222222222223) internal successors, (143), 118 states have internal predecessors, (143), 66 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 05:44:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 275 transitions. [2024-11-07 05:44:19,543 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 275 transitions. Word has length 182 [2024-11-07 05:44:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:19,543 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 275 transitions. [2024-11-07 05:44:19,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-07 05:44:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 275 transitions. [2024-11-07 05:44:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-07 05:44:19,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:19,546 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:19,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-07 05:44:19,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 05:44:19,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:44:19,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:19,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1045615156, now seen corresponding path program 1 times [2024-11-07 05:44:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:44:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96712106] [2024-11-07 05:44:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:19,948 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 05:44:19,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:44:19,950 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:44:19,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 05:44:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:20,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 05:44:20,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:20,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 777 proven. 36 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-11-07 05:44:20,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:44:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 05:44:20,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:44:20,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96712106] [2024-11-07 05:44:20,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96712106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:44:20,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:44:20,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-07 05:44:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821585423] [2024-11-07 05:44:20,571 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:44:20,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:44:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:44:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:44:20,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:44:20,573 INFO L87 Difference]: Start difference. First operand 193 states and 275 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-07 05:44:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:21,745 INFO L93 Difference]: Finished difference Result 302 states and 418 transitions. [2024-11-07 05:44:21,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 05:44:21,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 183 [2024-11-07 05:44:21,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:21,766 INFO L225 Difference]: With dead ends: 302 [2024-11-07 05:44:21,766 INFO L226 Difference]: Without dead ends: 175 [2024-11-07 05:44:21,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 358 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-07 05:44:21,768 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 146 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:21,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 187 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 05:44:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-07 05:44:21,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2024-11-07 05:44:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 99 states have internal predecessors, (110), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 05:44:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 222 transitions. [2024-11-07 05:44:21,803 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 222 transitions. Word has length 183 [2024-11-07 05:44:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:21,804 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 222 transitions. [2024-11-07 05:44:21,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-07 05:44:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 222 transitions. [2024-11-07 05:44:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-07 05:44:21,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:21,806 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:21,820 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 (8)] Ended with exit code 0 [2024-11-07 05:44:22,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 05:44:22,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:22,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:22,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1295955551, now seen corresponding path program 1 times [2024-11-07 05:44:22,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:44:22,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970371944] [2024-11-07 05:44:22,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:22,008 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 05:44:22,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:44:22,010 INFO L229 MonitoredProcess]: Starting monitored process 9 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 05:44:22,013 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 (9)] Waiting until timeout for monitored process [2024-11-07 05:44:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:23,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-07 05:44:23,178 INFO L278 TraceCheckSpWp]: Computing forward predicates...