./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.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', '24ca5306f015ab172719330a0597265b0f70dab4b133299f4b32574bb8d8923a'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.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 24ca5306f015ab172719330a0597265b0f70dab4b133299f4b32574bb8d8923a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:48:38,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:48:38,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:48:38,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:48:38,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:48:38,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:48:38,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:48:38,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:48:38,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:48:38,646 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:48:38,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:48:38,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:48:38,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:48:38,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:48:38,647 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:48:38,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:48:38,648 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:48:38,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:48:38,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:48:38,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:48:38,649 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:48:38,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:48:38,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:48:38,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:48:38,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:48:38,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:48:38,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:48:38,652 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 -> 24ca5306f015ab172719330a0597265b0f70dab4b133299f4b32574bb8d8923a [2024-11-07 06:48:38,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:48:38,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:48:38,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:48:38,965 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:48:38,966 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:48:38,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-07 06:48:40,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:48:40,516 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:48:40,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-07 06:48:40,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d58071e6/7b11c0fe7fd24f5190a4c3b2ffc1e545/FLAG9bd9948ca [2024-11-07 06:48:40,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d58071e6/7b11c0fe7fd24f5190a4c3b2ffc1e545 [2024-11-07 06:48:40,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:48:40,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:48:40,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:48:40,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:48:40,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:48:40,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3909d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40, skipping insertion in model container [2024-11-07 06:48:40,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:48:40,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i[919,932] [2024-11-07 06:48:40,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:48:40,806 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:48:40,821 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i[919,932] [2024-11-07 06:48:40,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:48:40,877 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:48:40,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40 WrapperNode [2024-11-07 06:48:40,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:48:40,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:48:40,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:48:40,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:48:40,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,939 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-07 06:48:40,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:48:40,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:48:40,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:48:40,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:48:40,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,970 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 06:48:40,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:48:40,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:48:40,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:48:40,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:48:40,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40" (1/1) ... [2024-11-07 06:48:40,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:48:41,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:48:41,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 06:48:41,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 06:48:41,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:48:41,043 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:48:41,043 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:48:41,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:48:41,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:48:41,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:48:41,141 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:48:41,143 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:48:41,538 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-07 06:48:41,538 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:48:41,550 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:48:41,552 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:48:41,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:48:41 BoogieIcfgContainer [2024-11-07 06:48:41,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:48:41,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:48:41,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:48:41,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:48:41,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:48:40" (1/3) ... [2024-11-07 06:48:41,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9c4e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:48:41, skipping insertion in model container [2024-11-07 06:48:41,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:48:40" (2/3) ... [2024-11-07 06:48:41,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9c4e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:48:41, skipping insertion in model container [2024-11-07 06:48:41,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:48:41" (3/3) ... [2024-11-07 06:48:41,564 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-07 06:48:41,578 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:48:41,579 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:48:41,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:48:41,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;@19df98cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:48:41,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:48:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 62 states have (on average 1.5) internal successors, (93), 63 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 06:48:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 06:48:41,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:48:41,684 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:48:41,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:48:41,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:48:41,690 INFO L85 PathProgramCache]: Analyzing trace with hash 110178093, now seen corresponding path program 1 times [2024-11-07 06:48:41,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:48:41,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586512250] [2024-11-07 06:48:41,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:48:41,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:48:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:42,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:48:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:42,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:48:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:42,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:48:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:42,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:48:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:42,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:48:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:42,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:48:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:42,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:48:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:42,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:48:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:48:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:48:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:48:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:48:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:48:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:48:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:48:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:48:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:48:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:48:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:48:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:48:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:48:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:48:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:48:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:48:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:48:43,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:48:43,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586512250] [2024-11-07 06:48:43,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586512250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:48:43,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:48:43,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:48:43,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384979736] [2024-11-07 06:48:43,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:48:43,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:48:43,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:48:43,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:48:43,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:48:43,104 INFO L87 Difference]: Start difference. First operand has 89 states, 62 states have (on average 1.5) internal successors, (93), 63 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:48:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:48:43,256 INFO L93 Difference]: Finished difference Result 183 states and 318 transitions. [2024-11-07 06:48:43,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:48:43,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-07 06:48:43,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:48:43,268 INFO L225 Difference]: With dead ends: 183 [2024-11-07 06:48:43,269 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 06:48:43,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:48:43,277 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 32 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:48:43,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 461 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:48:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 06:48:43,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2024-11-07 06:48:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 63 states have internal predecessors, (91), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 06:48:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2024-11-07 06:48:43,322 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 157 [2024-11-07 06:48:43,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:48:43,328 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2024-11-07 06:48:43,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:48:43,328 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2024-11-07 06:48:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 06:48:43,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:48:43,332 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:48:43,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:48:43,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:48:43,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:48:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash 112025135, now seen corresponding path program 1 times [2024-11-07 06:48:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:48:43,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12986262] [2024-11-07 06:48:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:48:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:48:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:48:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:48:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:48:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:48:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:48:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:48:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:48:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:48:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:48:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:48:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:48:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:48:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:48:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:48:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:48:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:48:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:48:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:48:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:48:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:48:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:48:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:48:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:48:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:48:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:48:43,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:48:43,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12986262] [2024-11-07 06:48:43,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12986262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:48:43,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:48:43,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:48:43,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067620735] [2024-11-07 06:48:43,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:48:43,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:48:43,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:48:43,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:48:43,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:48:43,929 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:48:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:48:44,180 INFO L93 Difference]: Finished difference Result 262 states and 412 transitions. [2024-11-07 06:48:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:48:44,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-07 06:48:44,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:48:44,183 INFO L225 Difference]: With dead ends: 262 [2024-11-07 06:48:44,183 INFO L226 Difference]: Without dead ends: 176 [2024-11-07 06:48:44,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:48:44,185 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 122 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:48:44,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 454 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:48:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-07 06:48:44,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 154. [2024-11-07 06:48:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 103 states have internal predecessors, (147), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 06:48:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 243 transitions. [2024-11-07 06:48:44,229 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 243 transitions. Word has length 157 [2024-11-07 06:48:44,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:48:44,230 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 243 transitions. [2024-11-07 06:48:44,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:48:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 243 transitions. [2024-11-07 06:48:44,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-07 06:48:44,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:48:44,235 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:48:44,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:48:44,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:48:44,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:48:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash 588459879, now seen corresponding path program 1 times [2024-11-07 06:48:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:48:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888399685] [2024-11-07 06:48:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:48:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:48:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:48:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:48:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:48:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:48:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:48:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:48:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:48:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:48:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:48:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:48:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:48:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:48:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:48:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:48:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:48:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:48:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:48:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:48:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:48:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:48:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:48:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:48:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:48:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:48:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 06:48:44,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:48:44,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888399685] [2024-11-07 06:48:44,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888399685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:48:44,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618262463] [2024-11-07 06:48:44,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:48:44,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:48:44,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:48:44,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:48:44,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 06:48:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:45,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 06:48:45,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:48:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-11-07 06:48:45,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:48:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 06:48:46,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618262463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:48:46,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:48:46,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2024-11-07 06:48:46,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503870463] [2024-11-07 06:48:46,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:48:46,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 06:48:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:48:46,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 06:48:46,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-07 06:48:46,440 INFO L87 Difference]: Start difference. First operand 154 states and 243 transitions. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-11-07 06:48:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:48:46,736 INFO L93 Difference]: Finished difference Result 264 states and 408 transitions. [2024-11-07 06:48:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 06:48:46,737 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) Word has length 158 [2024-11-07 06:48:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:48:46,741 INFO L225 Difference]: With dead ends: 264 [2024-11-07 06:48:46,741 INFO L226 Difference]: Without dead ends: 166 [2024-11-07 06:48:46,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-11-07 06:48:46,743 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 332 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:48:46,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 308 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:48:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-07 06:48:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 158. [2024-11-07 06:48:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 06:48:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2024-11-07 06:48:46,790 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 158 [2024-11-07 06:48:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:48:46,792 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2024-11-07 06:48:46,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-11-07 06:48:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2024-11-07 06:48:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:48:46,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:48:46,804 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:48:46,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 06:48:47,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:48:47,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:48:47,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:48:47,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1737674632, now seen corresponding path program 1 times [2024-11-07 06:48:47,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:48:47,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228472361] [2024-11-07 06:48:47,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:48:47,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:48:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:48:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:48:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:48:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:48:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:48:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:48:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:48:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:48:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:48:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:48:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:48:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:48:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:48:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:48:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:48:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:48:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:48:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:48:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:48:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:48:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:48:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:48:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:48:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:48:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:48:47,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:48:47,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228472361] [2024-11-07 06:48:47,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228472361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:48:47,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:48:47,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 06:48:47,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767062679] [2024-11-07 06:48:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:48:47,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:48:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:48:47,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:48:47,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:48:47,565 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 06:48:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:48:48,207 INFO L93 Difference]: Finished difference Result 564 states and 788 transitions. [2024-11-07 06:48:48,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 06:48:48,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159 [2024-11-07 06:48:48,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:48:48,211 INFO L225 Difference]: With dead ends: 564 [2024-11-07 06:48:48,212 INFO L226 Difference]: Without dead ends: 478 [2024-11-07 06:48:48,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-07 06:48:48,213 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 612 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 06:48:48,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 346 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 06:48:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-07 06:48:48,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 400. [2024-11-07 06:48:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 296 states have (on average 1.3445945945945945) internal successors, (398), 300 states have internal predecessors, (398), 88 states have call successors, (88), 15 states have call predecessors, (88), 15 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-07 06:48:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 574 transitions. [2024-11-07 06:48:48,297 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 574 transitions. Word has length 159 [2024-11-07 06:48:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:48:48,300 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 574 transitions. [2024-11-07 06:48:48,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 06:48:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 574 transitions. [2024-11-07 06:48:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:48:48,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:48:48,303 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:48:48,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:48:48,303 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:48:48,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:48:48,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1739521674, now seen corresponding path program 1 times [2024-11-07 06:48:48,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:48:48,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243300686] [2024-11-07 06:48:48,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:48:48,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:48:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:48:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:48:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:48:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:48:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:48:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:48:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:48:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:48:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:48:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:48:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:48:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:48:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:48:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:48:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:48:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:48:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:48:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:48:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:48:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:48:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:48:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:48:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:48:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:48:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 27 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 06:48:48,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:48:48,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243300686] [2024-11-07 06:48:48,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243300686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:48:48,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46840164] [2024-11-07 06:48:48,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:48:48,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:48:48,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:48:48,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:48:48,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 06:48:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:48,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 06:48:48,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:48:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 465 proven. 18 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-11-07 06:48:49,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:48:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 51 proven. 18 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 06:48:49,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46840164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:48:49,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:48:49,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 20 [2024-11-07 06:48:49,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436941825] [2024-11-07 06:48:49,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:48:49,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 06:48:49,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:48:49,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 06:48:49,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-11-07 06:48:49,750 INFO L87 Difference]: Start difference. First operand 400 states and 574 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2024-11-07 06:48:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:48:51,951 INFO L93 Difference]: Finished difference Result 1441 states and 1987 transitions. [2024-11-07 06:48:51,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-07 06:48:51,952 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) Word has length 159 [2024-11-07 06:48:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:48:51,966 INFO L225 Difference]: With dead ends: 1441 [2024-11-07 06:48:51,969 INFO L226 Difference]: Without dead ends: 1133 [2024-11-07 06:48:51,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=591, Invalid=2379, Unknown=0, NotChecked=0, Total=2970 [2024-11-07 06:48:51,973 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 945 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:48:51,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 905 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 06:48:51,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2024-11-07 06:48:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 814. [2024-11-07 06:48:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 615 states have (on average 1.338211382113821) internal successors, (823), 627 states have internal predecessors, (823), 161 states have call successors, (161), 37 states have call predecessors, (161), 37 states have return successors, (161), 149 states have call predecessors, (161), 161 states have call successors, (161) [2024-11-07 06:48:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1145 transitions. [2024-11-07 06:48:52,112 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1145 transitions. Word has length 159 [2024-11-07 06:48:52,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:48:52,113 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 1145 transitions. [2024-11-07 06:48:52,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2024-11-07 06:48:52,114 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1145 transitions. [2024-11-07 06:48:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 06:48:52,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:48:52,118 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:48:52,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 06:48:52,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:48:52,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:48:52,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:48:52,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2097654279, now seen corresponding path program 1 times [2024-11-07 06:48:52,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:48:52,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587052506] [2024-11-07 06:48:52,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:48:52,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:48:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:48:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:48:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:48:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:48:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:48:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:48:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:48:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:48:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:48:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:48:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:48:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:48:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:48:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:48:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:48:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:48:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:48:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:48:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:48:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:48:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:54,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:48:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:55,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:48:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:55,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:48:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:55,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:48:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 60 proven. 72 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-07 06:48:55,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:48:55,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587052506] [2024-11-07 06:48:55,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587052506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:48:55,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111278955] [2024-11-07 06:48:55,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:48:55,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:48:55,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:48:55,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:48:55,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 06:48:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:55,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 06:48:55,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:48:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 726 proven. 69 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-07 06:48:55,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:48:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-07 06:48:56,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111278955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:48:56,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:48:56,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 32 [2024-11-07 06:48:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158945991] [2024-11-07 06:48:56,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:48:56,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-07 06:48:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:48:56,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-07 06:48:56,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2024-11-07 06:48:56,554 INFO L87 Difference]: Start difference. First operand 814 states and 1145 transitions. Second operand has 32 states, 32 states have (on average 3.90625) internal successors, (125), 31 states have internal predecessors, (125), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 10 states have call predecessors, (72), 9 states have call successors, (72) [2024-11-07 06:49:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:01,235 INFO L93 Difference]: Finished difference Result 2058 states and 2831 transitions. [2024-11-07 06:49:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-07 06:49:01,236 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.90625) internal successors, (125), 31 states have internal predecessors, (125), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 10 states have call predecessors, (72), 9 states have call successors, (72) Word has length 160 [2024-11-07 06:49:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:01,244 INFO L225 Difference]: With dead ends: 2058 [2024-11-07 06:49:01,244 INFO L226 Difference]: Without dead ends: 1350 [2024-11-07 06:49:01,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1670 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1108, Invalid=4744, Unknown=0, NotChecked=0, Total=5852 [2024-11-07 06:49:01,249 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 1493 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:01,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1030 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 06:49:01,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2024-11-07 06:49:01,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1007. [2024-11-07 06:49:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 756 states have (on average 1.3174603174603174) internal successors, (996), 771 states have internal predecessors, (996), 199 states have call successors, (199), 51 states have call predecessors, (199), 51 states have return successors, (199), 184 states have call predecessors, (199), 199 states have call successors, (199) [2024-11-07 06:49:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1394 transitions. [2024-11-07 06:49:01,393 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1394 transitions. Word has length 160 [2024-11-07 06:49:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:01,393 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1394 transitions. [2024-11-07 06:49:01,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.90625) internal successors, (125), 31 states have internal predecessors, (125), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 10 states have call predecessors, (72), 9 states have call successors, (72) [2024-11-07 06:49:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1394 transitions. [2024-11-07 06:49:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 06:49:01,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:01,396 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:49:01,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 06:49:01,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:49:01,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:01,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:01,598 INFO L85 PathProgramCache]: Analyzing trace with hash -452636203, now seen corresponding path program 1 times [2024-11-07 06:49:01,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:49:01,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184770690] [2024-11-07 06:49:01,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:01,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:49:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:49:01,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:49:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:49:01,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:49:01,834 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:49:01,835 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:49:01,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:49:01,840 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:49:01,994 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:49:01,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:49:01 BoogieIcfgContainer [2024-11-07 06:49:01,998 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:49:01,999 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:49:01,999 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:49:01,999 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:49:02,000 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:48:41" (3/4) ... [2024-11-07 06:49:02,002 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:49:02,003 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:49:02,003 INFO L158 Benchmark]: Toolchain (without parser) took 21451.83ms. Allocated memory was 117.4MB in the beginning and 343.9MB in the end (delta: 226.5MB). Free memory was 91.4MB in the beginning and 132.7MB in the end (delta: -41.4MB). Peak memory consumption was 181.4MB. Max. memory is 16.1GB. [2024-11-07 06:49:02,004 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:49:02,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.37ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 76.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:49:02,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.21ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 74.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:49:02,004 INFO L158 Benchmark]: Boogie Preprocessor took 47.77ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 71.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:49:02,005 INFO L158 Benchmark]: RCFGBuilder took 563.92ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 49.4MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 06:49:02,005 INFO L158 Benchmark]: TraceAbstraction took 20443.43ms. Allocated memory was 117.4MB in the beginning and 343.9MB in the end (delta: 226.5MB). Free memory was 48.8MB in the beginning and 132.8MB in the end (delta: -84.1MB). Peak memory consumption was 139.5MB. Max. memory is 16.1GB. [2024-11-07 06:49:02,005 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 343.9MB. Free memory was 132.8MB in the beginning and 132.7MB in the end (delta: 86.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:49:02,006 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.46ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.37ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 76.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.21ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 74.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.77ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 71.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 563.92ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 49.4MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 20443.43ms. Allocated memory was 117.4MB in the beginning and 343.9MB in the end (delta: 226.5MB). Free memory was 48.8MB in the beginning and 132.8MB in the end (delta: -84.1MB). Peak memory consumption was 139.5MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 343.9MB. Free memory was 132.8MB in the beginning and 132.7MB in the end (delta: 86.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someUnaryDOUBLEoperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 184, overapproximation of someBinaryArithmeticFLOAToperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] signed char var_1_22 = -8; [L40] signed long int var_1_23 = -32; [L41] unsigned char var_1_25 = 10; [L42] unsigned char var_1_27 = 128; [L43] float var_1_30 = 31.3; [L44] float var_1_32 = 15.25; [L45] double var_1_33 = 128.8; [L46] signed char var_1_34 = 4; [L47] signed char var_1_35 = 1; [L48] unsigned char var_1_36 = 16; [L49] unsigned long int last_1_var_1_10 = 128; [L50] unsigned long int last_1_var_1_16 = 1; [L51] double last_1_var_1_19 = 3.8; VAL [isInitial=0, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L188] isInitial = 1 [L189] FCALL initially() [L190] COND TRUE 1 [L191] CALL updateLastVariables() [L179] last_1_var_1_10 = var_1_10 [L180] last_1_var_1_16 = var_1_16 [L181] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L191] RET updateLastVariables() [L192] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L146] var_1_7 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L147] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L149] var_1_8 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=4] [L150] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=4] [L151] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=4] [L151] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=4] [L152] var_1_9 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L153] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L154] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L155] var_1_11 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L156] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L157] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L158] var_1_17 = __VERIFIER_nondet_ulong() [L159] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L159] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L160] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L161] var_1_18 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L162] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L163] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L164] var_1_20 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L165] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L166] var_1_27 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L167] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L168] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L169] var_1_32 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L170] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L171] var_1_34 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L172] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L173] CALL assume_abort_if_not(var_1_34 <= 5) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L173] RET assume_abort_if_not(var_1_34 <= 5) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L174] var_1_35 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L175] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L176] CALL assume_abort_if_not(var_1_35 <= 4) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L176] RET assume_abort_if_not(var_1_35 <= 4) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L192] RET updateVariables() [L193] CALL step() [L55] var_1_22 = ((((-25) < 0 ) ? -(-25) : (-25))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L56] COND FALSE !(var_1_7 > var_1_12) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L63] EXPR var_1_12 >> var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L63] EXPR ((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L63] COND FALSE !(var_1_18 <= ((((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7))))) [L66] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L70] COND TRUE \read(var_1_1) [L71] var_1_30 = ((((var_1_20) < ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32)))))) ? (var_1_20) : ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L73] COND FALSE !(var_1_9 >= var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L86] COND TRUE var_1_27 >= (var_1_9 + var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L87] COND TRUE (-0.95f * ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > var_1_20 [L88] var_1_36 = (var_1_27 - var_1_35) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L97] unsigned long int stepLocal_1 = last_1_var_1_16; [L98] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L99] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L100] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L108] COND TRUE var_1_12 == var_1_12 [L109] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L111] var_1_1 = (var_1_2 || (! var_1_3)) [L112] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L113] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L114] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L115] COND FALSE !(var_1_19 >= var_1_19) [L120] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L125] COND TRUE var_1_19 != var_1_19 [L126] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=63, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L134] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=63, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L135] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2 [L136] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=63, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L193] RET step() [L194] CALL, EXPR property() [L184-L185] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=63, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=63, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=63, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3586 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3536 mSDsluCounter, 3504 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2893 mSDsCounter, 1212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3858 IncrementalHoareTripleChecker+Invalid, 5070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1212 mSolverCounterUnsat, 611 mSDtfsCounter, 3858 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1394 GetRequests, 1232 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2431 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1007occurred in iteration=6, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 778 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 1588 NumberOfCodeBlocks, 1588 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1892 ConstructedInterpolants, 0 QuantifiedInterpolants, 10128 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1151 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 12792/13248 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 06:49:02,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.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 24ca5306f015ab172719330a0597265b0f70dab4b133299f4b32574bb8d8923a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:49:04,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:49:04,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:49:04,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:49:04,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:49:04,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:49:04,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:49:04,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:49:04,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:49:04,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:49:04,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:49:04,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:49:04,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:49:04,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:49:04,503 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:49:04,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:49:04,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:49:04,503 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:49:04,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:49:04,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:49:04,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:49:04,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:49:04,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:49:04,506 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:49:04,506 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:49:04,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:49:04,507 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:49:04,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:49:04,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:49:04,507 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:49:04,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:49:04,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:49:04,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:49:04,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:49:04,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:49:04,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:49:04,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:49:04,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:49:04,508 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:49:04,508 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:49:04,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:49:04,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:49:04,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:49:04,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:49:04,508 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 -> 24ca5306f015ab172719330a0597265b0f70dab4b133299f4b32574bb8d8923a [2024-11-07 06:49:04,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:49:04,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:49:04,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:49:04,795 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:49:04,795 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:49:04,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-07 06:49:06,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:49:06,430 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:49:06,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-07 06:49:06,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/acd0c1c5f/407f37b7ee2744dfa8cb1419d082a602/FLAG4641ecd25 [2024-11-07 06:49:06,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/acd0c1c5f/407f37b7ee2744dfa8cb1419d082a602 [2024-11-07 06:49:06,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:49:06,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:49:06,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:49:06,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:49:06,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:49:06,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fab2998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06, skipping insertion in model container [2024-11-07 06:49:06,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:49:06,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i[919,932] [2024-11-07 06:49:06,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:49:06,744 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:49:06,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i[919,932] [2024-11-07 06:49:06,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:49:06,830 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:49:06,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06 WrapperNode [2024-11-07 06:49:06,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:49:06,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:49:06,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:49:06,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:49:06,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,897 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-07 06:49:06,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:49:06,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:49:06,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:49:06,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:49:06,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,942 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 06:49:06,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:49:06,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:49:06,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:49:06,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:49:06,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06" (1/1) ... [2024-11-07 06:49:06,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:49:07,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:49:07,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 06:49:07,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 06:49:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:49:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:49:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:49:07,050 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:49:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:49:07,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:49:07,155 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:49:07,157 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:49:09,055 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 06:49:09,056 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:49:09,071 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:49:09,071 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:49:09,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:09 BoogieIcfgContainer [2024-11-07 06:49:09,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:49:09,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:49:09,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:49:09,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:49:09,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:49:06" (1/3) ... [2024-11-07 06:49:09,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a1eab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:09, skipping insertion in model container [2024-11-07 06:49:09,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:06" (2/3) ... [2024-11-07 06:49:09,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a1eab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:09, skipping insertion in model container [2024-11-07 06:49:09,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:09" (3/3) ... [2024-11-07 06:49:09,084 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-07 06:49:09,099 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:49:09,100 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:49:09,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:49:09,169 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;@1637bc0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:49:09,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:49:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 06:49:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 06:49:09,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:09,189 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:49:09,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:09,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 898373128, now seen corresponding path program 1 times [2024-11-07 06:49:09,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:49:09,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637251118] [2024-11-07 06:49:09,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:09,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:49:09,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:49:09,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:49:09,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 06:49:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:09,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:49:09,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:49:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-07 06:49:09,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:49:09,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:49:09,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637251118] [2024-11-07 06:49:09,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637251118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:49:09,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:49:09,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:49:09,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598404096] [2024-11-07 06:49:09,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:49:09,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:49:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:49:09,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:49:09,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:49:09,530 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 06:49:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:09,557 INFO L93 Difference]: Finished difference Result 155 states and 276 transitions. [2024-11-07 06:49:09,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:49:09,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 155 [2024-11-07 06:49:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:09,569 INFO L225 Difference]: With dead ends: 155 [2024-11-07 06:49:09,569 INFO L226 Difference]: Without dead ends: 77 [2024-11-07 06:49:09,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:49:09,577 INFO L432 NwaCegarLoop]: 120 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, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:09,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:49:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-07 06:49:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-07 06:49:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 06:49:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2024-11-07 06:49:09,626 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 155 [2024-11-07 06:49:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:09,626 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2024-11-07 06:49:09,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 06:49:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2024-11-07 06:49:09,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 06:49:09,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:09,632 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:49:09,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 06:49:09,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:49:09,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:09,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:09,835 INFO L85 PathProgramCache]: Analyzing trace with hash -999648376, now seen corresponding path program 1 times [2024-11-07 06:49:09,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:49:09,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206922142] [2024-11-07 06:49:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:09,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:49:09,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:49:09,838 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:49:09,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 06:49:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:10,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:49:10,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:49:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:49:10,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:49:10,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:49:10,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206922142] [2024-11-07 06:49:10,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206922142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:49:10,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:49:10,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:49:10,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732615088] [2024-11-07 06:49:10,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:49:10,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:49:10,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:49:10,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:49:10,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:49:10,633 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:49:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:12,414 INFO L93 Difference]: Finished difference Result 212 states and 335 transitions. [2024-11-07 06:49:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:49:12,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-11-07 06:49:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:12,432 INFO L225 Difference]: With dead ends: 212 [2024-11-07 06:49:12,433 INFO L226 Difference]: Without dead ends: 138 [2024-11-07 06:49:12,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:49:12,435 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 28 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:12,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 229 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 06:49:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-07 06:49:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 125. [2024-11-07 06:49:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 06:49:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 194 transitions. [2024-11-07 06:49:12,466 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 194 transitions. Word has length 155 [2024-11-07 06:49:12,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:12,467 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 194 transitions. [2024-11-07 06:49:12,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:49:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 194 transitions. [2024-11-07 06:49:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 06:49:12,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:12,469 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:49:12,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 06:49:12,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:49:12,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:12,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:12,675 INFO L85 PathProgramCache]: Analyzing trace with hash 280215302, now seen corresponding path program 1 times [2024-11-07 06:49:12,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:49:12,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881860081] [2024-11-07 06:49:12,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:12,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:49:12,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:49:12,680 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:49:12,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 06:49:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:12,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:49:12,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:49:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:49:14,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:49:14,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:49:14,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881860081] [2024-11-07 06:49:14,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881860081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:49:14,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:49:14,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:49:14,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812158545] [2024-11-07 06:49:14,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:49:14,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:49:14,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:49:14,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:49:14,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:49:14,027 INFO L87 Difference]: Start difference. First operand 125 states and 194 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:49:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:14,509 INFO L93 Difference]: Finished difference Result 226 states and 354 transitions. [2024-11-07 06:49:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:49:14,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-11-07 06:49:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:14,514 INFO L225 Difference]: With dead ends: 226 [2024-11-07 06:49:14,514 INFO L226 Difference]: Without dead ends: 152 [2024-11-07 06:49:14,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:49:14,515 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 93 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:14,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 402 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:49:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-07 06:49:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2024-11-07 06:49:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 06:49:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 210 transitions. [2024-11-07 06:49:14,549 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 210 transitions. Word has length 155 [2024-11-07 06:49:14,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:14,550 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 210 transitions. [2024-11-07 06:49:14,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:49:14,550 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 210 transitions. [2024-11-07 06:49:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 06:49:14,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:14,555 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:49:14,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 06:49:14,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:49:14,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:14,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1562798992, now seen corresponding path program 1 times [2024-11-07 06:49:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:49:14,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366761969] [2024-11-07 06:49:14,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:14,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:49:14,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:49:14,766 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:49:14,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 06:49:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:15,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 06:49:15,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:49:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-11-07 06:49:15,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:49:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 06:49:15,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:49:15,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366761969] [2024-11-07 06:49:15,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366761969] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:49:15,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:49:15,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-07 06:49:15,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857471822] [2024-11-07 06:49:15,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:49:15,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 06:49:15,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:49:15,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 06:49:15,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:49:15,749 INFO L87 Difference]: Start difference. First operand 134 states and 210 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-07 06:49:17,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:17,080 INFO L93 Difference]: Finished difference Result 234 states and 358 transitions. [2024-11-07 06:49:17,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 06:49:17,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 156 [2024-11-07 06:49:17,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:17,085 INFO L225 Difference]: With dead ends: 234 [2024-11-07 06:49:17,085 INFO L226 Difference]: Without dead ends: 150 [2024-11-07 06:49:17,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-07 06:49:17,089 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 120 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:17,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 199 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 06:49:17,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-07 06:49:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 142. [2024-11-07 06:49:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 states have internal predecessors, (115), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 06:49:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 211 transitions. [2024-11-07 06:49:17,131 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 211 transitions. Word has length 156 [2024-11-07 06:49:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:17,133 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 211 transitions. [2024-11-07 06:49:17,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-07 06:49:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 211 transitions. [2024-11-07 06:49:17,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 06:49:17,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:17,137 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:49:17,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 06:49:17,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:49:17,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:17,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:17,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1934674337, now seen corresponding path program 1 times [2024-11-07 06:49:17,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:49:17,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393824129] [2024-11-07 06:49:17,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:17,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:49:17,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:49:17,346 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:49:17,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 06:49:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:17,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 06:49:17,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:49:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:49:18,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:49:18,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:49:18,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393824129] [2024-11-07 06:49:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393824129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:49:18,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:49:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:49:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732271500] [2024-11-07 06:49:18,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:49:18,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:49:18,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:49:18,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:49:18,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:49:18,020 INFO L87 Difference]: Start difference. First operand 142 states and 211 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:49:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:22,679 INFO L93 Difference]: Finished difference Result 224 states and 333 transitions. [2024-11-07 06:49:22,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:49:22,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-07 06:49:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:22,682 INFO L225 Difference]: With dead ends: 224 [2024-11-07 06:49:22,683 INFO L226 Difference]: Without dead ends: 146 [2024-11-07 06:49:22,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:49:22,684 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 96 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:22,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 266 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-07 06:49:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-07 06:49:22,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2024-11-07 06:49:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 89 states have internal predecessors, (112), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 06:49:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2024-11-07 06:49:22,720 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 157 [2024-11-07 06:49:22,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:22,721 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2024-11-07 06:49:22,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:49:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2024-11-07 06:49:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:49:22,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:22,727 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:49:22,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 06:49:22,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:49:22,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:22,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:22,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1624509410, now seen corresponding path program 1 times [2024-11-07 06:49:22,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:49:22,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545248935] [2024-11-07 06:49:22,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:22,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:49:22,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:49:22,932 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:49:22,935 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 (7)] Waiting until timeout for monitored process [2024-11-07 06:49:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:23,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 06:49:23,160 INFO L278 TraceCheckSpWp]: Computing forward predicates...