./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.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_codestructure_steplocals_file-47.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', '874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40'] 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_codestructure_steplocals_file-47.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 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:21:27,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:21:27,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:21:27,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:21:27,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:21:27,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:21:27,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:21:27,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:21:27,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:21:27,797 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:21:27,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:21:27,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:21:27,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:21:27,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:21:27,798 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:21:27,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:21:27,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:21:27,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:21:27,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:21:27,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:21:27,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:21:27,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:21:27,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:21:27,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:21:27,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:21:27,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:21:27,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:21:27,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:21:27,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:21:27,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:21:27,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:21:27,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:21:27,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:21:27,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:21:27,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:21:27,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:21:27,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:21:27,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:21:27,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:21:27,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:21:27,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:21:27,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:21:27,802 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 -> 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 [2024-11-07 04:21:28,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:21:28,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:21:28,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:21:28,121 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:21:28,122 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:21:28,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2024-11-07 04:21:29,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:21:29,747 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:21:29,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2024-11-07 04:21:29,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85eb2b770/4e1a90c847db41df89c4948ddfedaf12/FLAGd38aa4668 [2024-11-07 04:21:29,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85eb2b770/4e1a90c847db41df89c4948ddfedaf12 [2024-11-07 04:21:29,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:21:29,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:21:29,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:21:29,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:21:29,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:21:29,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:21:29" (1/1) ... [2024-11-07 04:21:29,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb3f938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29, skipping insertion in model container [2024-11-07 04:21:29,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:21:29" (1/1) ... [2024-11-07 04:21:29,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:21:29,966 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_codestructure_steplocals_file-47.i[917,930] [2024-11-07 04:21:30,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:21:30,067 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:21:30,079 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_codestructure_steplocals_file-47.i[917,930] [2024-11-07 04:21:30,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:21:30,131 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:21:30,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30 WrapperNode [2024-11-07 04:21:30,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:21:30,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:21:30,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:21:30,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:21:30,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30" (1/1) ... [2024-11-07 04:21:30,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30" (1/1) ... [2024-11-07 04:21:30,214 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-11-07 04:21:30,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:21:30,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:21:30,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:21:30,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:21:30,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30" (1/1) ... [2024-11-07 04:21:30,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30" (1/1) ... [2024-11-07 04:21:30,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30" (1/1) ... [2024-11-07 04:21:30,256 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 04:21:30,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30" (1/1) ... [2024-11-07 04:21:30,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30" (1/1) ... [2024-11-07 04:21:30,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30" (1/1) ... [2024-11-07 04:21:30,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30" (1/1) ... [2024-11-07 04:21:30,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30" (1/1) ... [2024-11-07 04:21:30,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30" (1/1) ... [2024-11-07 04:21:30,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:21:30,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:21:30,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:21:30,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:21:30,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30" (1/1) ... [2024-11-07 04:21:30,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:21:30,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:21:30,336 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 04:21:30,342 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 04:21:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:21:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:21:30,362 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:21:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:21:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:21:30,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:21:30,445 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:21:30,447 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:21:30,862 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-07 04:21:30,863 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:21:30,872 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:21:30,875 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:21:30,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:21:30 BoogieIcfgContainer [2024-11-07 04:21:30,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:21:30,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:21:30,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:21:30,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:21:30,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:21:29" (1/3) ... [2024-11-07 04:21:30,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e751252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:21:30, skipping insertion in model container [2024-11-07 04:21:30,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:30" (2/3) ... [2024-11-07 04:21:30,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e751252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:21:30, skipping insertion in model container [2024-11-07 04:21:30,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:21:30" (3/3) ... [2024-11-07 04:21:30,887 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-47.i [2024-11-07 04:21:30,900 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:21:30,900 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:21:30,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:21:30,967 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;@5e16827e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:21:30,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:21:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 04:21:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 04:21:30,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:21:30,985 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:30,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:21:30,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:21:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1028946964, now seen corresponding path program 1 times [2024-11-07 04:21:30,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:21:30,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585698727] [2024-11-07 04:21:30,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:30,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:21:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:21:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:21:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:21:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:21:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:21:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:21:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:21:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:21:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:21:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:21:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:21:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:21:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:21:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:21:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:21:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:21:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:21:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:21:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:21:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:21:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 04:21:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:21:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 04:21:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 04:21:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 04:21:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 04:21:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 04:21:31,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:21:31,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585698727] [2024-11-07 04:21:31,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585698727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:21:31,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:21:31,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:21:31,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152366492] [2024-11-07 04:21:31,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:21:31,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:21:31,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:21:31,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:21:31,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:21:31,544 INFO L87 Difference]: Start difference. First operand has 97 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 04:21:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:21:31,574 INFO L93 Difference]: Finished difference Result 187 states and 322 transitions. [2024-11-07 04:21:31,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:21:31,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2024-11-07 04:21:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:21:31,584 INFO L225 Difference]: With dead ends: 187 [2024-11-07 04:21:31,584 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 04:21:31,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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 04:21:31,592 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:21:31,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:21:31,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 04:21:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 04:21:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 04:21:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 140 transitions. [2024-11-07 04:21:31,643 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 140 transitions. Word has length 168 [2024-11-07 04:21:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:21:31,644 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 140 transitions. [2024-11-07 04:21:31,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 04:21:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 140 transitions. [2024-11-07 04:21:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 04:21:31,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:21:31,651 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:31,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:21:31,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:21:31,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:21:31,653 INFO L85 PathProgramCache]: Analyzing trace with hash 461797976, now seen corresponding path program 1 times [2024-11-07 04:21:31,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:21:31,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924280089] [2024-11-07 04:21:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:31,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:21:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:21:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:21:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:21:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:21:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:21:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:21:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:21:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:21:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:21:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:21:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:21:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:21:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:21:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:21:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:21:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:21:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:21:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:21:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:21:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:21:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 04:21:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:21:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 04:21:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 04:21:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 04:21:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 04:21:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-07 04:21:32,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:21:32,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924280089] [2024-11-07 04:21:32,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924280089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:21:32,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816342294] [2024-11-07 04:21:32,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:32,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:21:32,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:21:32,833 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 04:21:32,835 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 04:21:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:33,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 04:21:33,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:21:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 465 proven. 15 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-07 04:21:33,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:21:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-07 04:21:33,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816342294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:21:33,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 04:21:33,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-07 04:21:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550557265] [2024-11-07 04:21:33,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 04:21:33,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 04:21:33,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:21:33,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 04:21:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 04:21:33,470 INFO L87 Difference]: Start difference. First operand 93 states and 140 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 04:21:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:21:34,684 INFO L93 Difference]: Finished difference Result 414 states and 617 transitions. [2024-11-07 04:21:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 04:21:34,684 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 169 [2024-11-07 04:21:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:21:34,690 INFO L225 Difference]: With dead ends: 414 [2024-11-07 04:21:34,691 INFO L226 Difference]: Without dead ends: 324 [2024-11-07 04:21:34,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2024-11-07 04:21:34,695 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 503 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 04:21:34,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 916 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 04:21:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-07 04:21:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 217. [2024-11-07 04:21:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 142 states have internal predecessors, (179), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-07 04:21:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 323 transitions. [2024-11-07 04:21:34,765 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 323 transitions. Word has length 169 [2024-11-07 04:21:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:21:34,766 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 323 transitions. [2024-11-07 04:21:34,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 04:21:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 323 transitions. [2024-11-07 04:21:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 04:21:34,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:21:34,769 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:34,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 04:21:34,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:21:34,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:21:34,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:21:34,971 INFO L85 PathProgramCache]: Analyzing trace with hash -818065702, now seen corresponding path program 1 times [2024-11-07 04:21:34,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:21:34,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806486395] [2024-11-07 04:21:34,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:34,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:21:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:35,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:21:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:35,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:21:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:35,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:21:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:35,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:21:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:35,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:21:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:35,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:21:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:35,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:21:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:35,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:21:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:35,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:21:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:21:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:21:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:21:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:21:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:21:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:21:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:21:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:21:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:21:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:21:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:21:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 04:21:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:21:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 04:21:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 04:21:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 04:21:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 04:21:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 114 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-11-07 04:21:36,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:21:36,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806486395] [2024-11-07 04:21:36,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806486395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:21:36,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981429942] [2024-11-07 04:21:36,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:36,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:21:36,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:21:36,091 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 04:21:36,093 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 04:21:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:36,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 04:21:36,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:21:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-11-07 04:21:37,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:21:38,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981429942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:21:38,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 04:21:38,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2024-11-07 04:21:38,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112162474] [2024-11-07 04:21:38,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 04:21:38,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 04:21:38,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:21:38,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 04:21:38,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-11-07 04:21:38,350 INFO L87 Difference]: Start difference. First operand 217 states and 323 transitions. Second operand has 20 states, 20 states have (on average 4.55) internal successors, (91), 20 states have internal predecessors, (91), 7 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 7 states have call predecessors, (52), 7 states have call successors, (52) [2024-11-07 04:21:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:21:41,753 INFO L93 Difference]: Finished difference Result 1169 states and 1622 transitions. [2024-11-07 04:21:41,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-07 04:21:41,757 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.55) internal successors, (91), 20 states have internal predecessors, (91), 7 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 7 states have call predecessors, (52), 7 states have call successors, (52) Word has length 169 [2024-11-07 04:21:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:21:41,769 INFO L225 Difference]: With dead ends: 1169 [2024-11-07 04:21:41,770 INFO L226 Difference]: Without dead ends: 988 [2024-11-07 04:21:41,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=859, Invalid=4253, Unknown=0, NotChecked=0, Total=5112 [2024-11-07 04:21:41,778 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 806 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 2486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 04:21:41,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1205 Invalid, 2486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 04:21:41,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-11-07 04:21:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 439. [2024-11-07 04:21:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 309 states have (on average 1.2459546925566343) internal successors, (385), 312 states have internal predecessors, (385), 107 states have call successors, (107), 22 states have call predecessors, (107), 22 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-11-07 04:21:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 599 transitions. [2024-11-07 04:21:41,862 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 599 transitions. Word has length 169 [2024-11-07 04:21:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:21:41,864 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 599 transitions. [2024-11-07 04:21:41,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.55) internal successors, (91), 20 states have internal predecessors, (91), 7 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 7 states have call predecessors, (52), 7 states have call successors, (52) [2024-11-07 04:21:41,864 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 599 transitions. [2024-11-07 04:21:41,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 04:21:41,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:21:41,868 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:41,888 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 04:21:42,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:21:42,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:21:42,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:21:42,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2033180088, now seen corresponding path program 1 times [2024-11-07 04:21:42,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:21:42,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311328522] [2024-11-07 04:21:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:21:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:21:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:21:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:21:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:21:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:21:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:21:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:21:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:21:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:21:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:21:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:21:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:21:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:21:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:21:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:21:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:21:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:21:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:21:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:21:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:21:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 04:21:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:21:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 04:21:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 04:21:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 04:21:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 04:21:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 04:21:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:21:42,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311328522] [2024-11-07 04:21:42,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311328522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:21:42,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:21:42,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:21:42,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043656998] [2024-11-07 04:21:42,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:21:42,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:21:42,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:21:42,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:21:42,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:21:42,190 INFO L87 Difference]: Start difference. First operand 439 states and 599 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 04:21:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:21:42,291 INFO L93 Difference]: Finished difference Result 1129 states and 1525 transitions. [2024-11-07 04:21:42,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:21:42,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-07 04:21:42,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:21:42,297 INFO L225 Difference]: With dead ends: 1129 [2024-11-07 04:21:42,298 INFO L226 Difference]: Without dead ends: 738 [2024-11-07 04:21:42,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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 04:21:42,300 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 92 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:21:42,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 354 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:21:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-07 04:21:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 733. [2024-11-07 04:21:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 539 states have (on average 1.2448979591836735) internal successors, (671), 546 states have internal predecessors, (671), 155 states have call successors, (155), 38 states have call predecessors, (155), 38 states have return successors, (155), 148 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-07 04:21:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 981 transitions. [2024-11-07 04:21:42,388 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 981 transitions. Word has length 170 [2024-11-07 04:21:42,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:21:42,389 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 981 transitions. [2024-11-07 04:21:42,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 04:21:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 981 transitions. [2024-11-07 04:21:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 04:21:42,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:21:42,391 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:42,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:21:42,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:21:42,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:21:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1007410628, now seen corresponding path program 1 times [2024-11-07 04:21:42,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:21:42,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809907856] [2024-11-07 04:21:42,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:42,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:21:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:21:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:21:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:21:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:21:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:21:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:21:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:21:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:21:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:21:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:21:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:21:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:21:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:21:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:21:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:21:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:21:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:21:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:21:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:21:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:21:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 04:21:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:21:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 04:21:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 04:21:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 04:21:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 04:21:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 04:21:42,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:21:42,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809907856] [2024-11-07 04:21:42,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809907856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:21:42,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:21:42,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:21:42,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072281786] [2024-11-07 04:21:42,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:21:42,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:21:42,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:21:42,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:21:42,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:21:42,505 INFO L87 Difference]: Start difference. First operand 733 states and 981 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 04:21:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:21:42,660 INFO L93 Difference]: Finished difference Result 1878 states and 2510 transitions. [2024-11-07 04:21:42,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:21:42,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-07 04:21:42,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:21:42,674 INFO L225 Difference]: With dead ends: 1878 [2024-11-07 04:21:42,674 INFO L226 Difference]: Without dead ends: 1193 [2024-11-07 04:21:42,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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 04:21:42,677 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 127 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:21:42,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 355 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:21:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-07 04:21:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 733. [2024-11-07 04:21:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 539 states have (on average 1.2374768089053803) internal successors, (667), 546 states have internal predecessors, (667), 155 states have call successors, (155), 38 states have call predecessors, (155), 38 states have return successors, (155), 148 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-07 04:21:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 977 transitions. [2024-11-07 04:21:42,770 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 977 transitions. Word has length 170 [2024-11-07 04:21:42,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:21:42,770 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 977 transitions. [2024-11-07 04:21:42,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 04:21:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 977 transitions. [2024-11-07 04:21:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 04:21:42,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:21:42,773 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:42,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 04:21:42,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:21:42,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:21:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash -306346050, now seen corresponding path program 1 times [2024-11-07 04:21:42,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:21:42,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358509] [2024-11-07 04:21:42,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:42,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:21:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:21:42,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [485817260] [2024-11-07 04:21:42,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:42,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:21:42,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:21:42,850 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 04:21:42,852 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 04:21:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 04:21:42,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:21:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 295 proven. 66 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2024-11-07 04:21:43,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:21:43,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:21:43,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358509] [2024-11-07 04:21:43,600 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 04:21:43,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485817260] [2024-11-07 04:21:43,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485817260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:21:43,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 04:21:43,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-07 04:21:43,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576336966] [2024-11-07 04:21:43,601 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 04:21:43,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 04:21:43,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:21:43,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 04:21:43,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 04:21:43,602 INFO L87 Difference]: Start difference. First operand 733 states and 977 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 04:21:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:21:43,996 INFO L93 Difference]: Finished difference Result 1462 states and 1945 transitions. [2024-11-07 04:21:43,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 04:21:43,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2024-11-07 04:21:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:21:44,002 INFO L225 Difference]: With dead ends: 1462 [2024-11-07 04:21:44,003 INFO L226 Difference]: Without dead ends: 777 [2024-11-07 04:21:44,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-07 04:21:44,006 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 65 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:21:44,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 420 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 04:21:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-07 04:21:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 745. [2024-11-07 04:21:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 551 states have (on average 1.2431941923774954) internal successors, (685), 558 states have internal predecessors, (685), 155 states have call successors, (155), 38 states have call predecessors, (155), 38 states have return successors, (155), 148 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-07 04:21:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 995 transitions. [2024-11-07 04:21:44,081 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 995 transitions. Word has length 170 [2024-11-07 04:21:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:21:44,081 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 995 transitions. [2024-11-07 04:21:44,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 04:21:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 995 transitions. [2024-11-07 04:21:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 04:21:44,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:21:44,084 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:44,102 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 04:21:44,284 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 04:21:44,285 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:21:44,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:21:44,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1468661312, now seen corresponding path program 1 times [2024-11-07 04:21:44,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:21:44,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180341249] [2024-11-07 04:21:44,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:44,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:21:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:21:44,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683904007] [2024-11-07 04:21:44,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:44,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:21:44,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:21:44,371 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 04:21:44,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 04:21:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:21:44,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:21:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:21:44,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:21:44,730 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:21:44,731 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:21:44,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 04:21:44,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-07 04:21:44,936 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:21:45,049 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:21:45,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:21:45 BoogieIcfgContainer [2024-11-07 04:21:45,056 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:21:45,056 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:21:45,057 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:21:45,057 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:21:45,058 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:21:30" (3/4) ... [2024-11-07 04:21:45,059 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:21:45,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:21:45,062 INFO L158 Benchmark]: Toolchain (without parser) took 15271.29ms. Allocated memory was 100.7MB in the beginning and 218.1MB in the end (delta: 117.4MB). Free memory was 76.6MB in the beginning and 158.9MB in the end (delta: -82.2MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2024-11-07 04:21:45,062 INFO L158 Benchmark]: CDTParser took 1.26ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:21:45,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.13ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 61.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:21:45,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.55ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 57.2MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:21:45,063 INFO L158 Benchmark]: Boogie Preprocessor took 82.99ms. Allocated memory is still 100.7MB. Free memory was 57.2MB in the beginning and 51.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:21:45,063 INFO L158 Benchmark]: RCFGBuilder took 575.92ms. Allocated memory is still 100.7MB. Free memory was 51.1MB in the beginning and 60.2MB in the end (delta: -9.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-07 04:21:45,064 INFO L158 Benchmark]: TraceAbstraction took 14177.97ms. Allocated memory was 100.7MB in the beginning and 218.1MB in the end (delta: 117.4MB). Free memory was 59.8MB in the beginning and 161.2MB in the end (delta: -101.4MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-11-07 04:21:45,064 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 218.1MB. Free memory was 161.2MB in the beginning and 158.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:21:45,065 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.26ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.13ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 61.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.55ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 57.2MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 82.99ms. Allocated memory is still 100.7MB. Free memory was 57.2MB in the beginning and 51.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 575.92ms. Allocated memory is still 100.7MB. Free memory was 51.1MB in the beginning and 60.2MB in the end (delta: -9.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14177.97ms. Allocated memory was 100.7MB in the beginning and 218.1MB in the end (delta: 117.4MB). Free memory was 59.8MB in the beginning and 161.2MB in the end (delta: -101.4MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 218.1MB. Free memory was 161.2MB in the beginning and 158.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryFLOATComparisonOperation at line 136. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_2 = 50.5; [L24] double var_1_3 = 0.875; [L25] unsigned short int var_1_4 = 49926; [L26] unsigned short int var_1_5 = 500; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 2; [L29] unsigned char var_1_8 = 64; [L30] unsigned short int var_1_9 = 5; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 10; [L33] float var_1_12 = 0.19999999999999996; [L34] float var_1_13 = 9.2; [L35] float var_1_14 = 5.8; [L36] float var_1_15 = 31.25; [L37] unsigned char var_1_16 = 1; [L38] unsigned char var_1_17 = 0; [L39] unsigned char var_1_18 = 0; [L40] unsigned char var_1_19 = 1; [L41] unsigned short int var_1_20 = 256; [L42] unsigned short int var_1_21 = 23544; [L43] unsigned long int var_1_22 = 64; VAL [isInitial=0, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_2=101/2, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L92] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L93] var_1_3 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L94] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L95] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L95] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L96] var_1_4 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L97] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L98] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L98] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L99] var_1_5 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L100] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L101] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L101] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L102] var_1_6 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_7=2, var_1_8=64, var_1_9=5] [L103] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_7=2, var_1_8=64, var_1_9=5] [L104] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=2, var_1_8=64, var_1_9=5] [L104] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=2, var_1_8=64, var_1_9=5] [L105] var_1_7 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_8=64, var_1_9=5] [L106] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_8=64, var_1_9=5] [L107] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=5] [L107] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=5] [L108] var_1_9 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64] [L109] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64] [L110] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L110] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L113] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L113] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L114] var_1_11 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L115] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L116] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L116] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L117] var_1_13 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L118] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L119] var_1_14 = __VERIFIER_nondet_float() [L120] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L120] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L121] var_1_15 = __VERIFIER_nondet_float() [L122] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L122] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L123] var_1_17 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L124] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L125] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L125] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L126] var_1_18 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L127] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L128] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L128] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L129] var_1_21 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L130] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L131] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L131] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L144] RET updateVariables() [L145] CALL step() [L47] COND TRUE var_1_2 >= (1.3 / var_1_3) [L48] var_1_1 = ((var_1_4 - var_1_5) - var_1_6) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L52] signed long int stepLocal_0 = 32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))); VAL [isInitial=1, stepLocal_0=16384, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L53] COND FALSE !(var_1_5 >= stepLocal_0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L58] COND FALSE !(\read(var_1_10)) [L63] var_1_12 = var_1_14 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L65] COND FALSE !((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) [L68] var_1_16 = var_1_18 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L70] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L71] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L76] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, stepLocal_1=1, stepLocal_2=49150, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L77] COND TRUE var_1_6 <= stepLocal_2 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L78] COND FALSE !(\read(var_1_16)) [L81] var_1_20 = 16 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L86] EXPR 2 ^ var_1_1 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L86] EXPR (((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1)) VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L86] COND FALSE !(var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR (((((((var_1_2 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_5) - var_1_6))) : (var_1_1 == ((unsigned short int) ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (var_1_10 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_10 ? (((var_1_8 * var_1_7) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) ? (var_1_16 == ((unsigned char) (var_1_10 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_10) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_6 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_5))))) && ((var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) ? (var_1_22 == ((unsigned long int) var_1_8)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L136-L137] return (((((((var_1_2 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_5) - var_1_6))) : (var_1_1 == ((unsigned short int) ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (var_1_10 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_10 ? (((var_1_8 * var_1_7) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) ? (var_1_16 == ((unsigned char) (var_1_10 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_10) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_6 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_5))))) && ((var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) ? (var_1_22 == ((unsigned long int) var_1_8)) : 1) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 7, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1638 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1593 mSDsluCounter, 3390 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2286 mSDsCounter, 608 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3135 IncrementalHoareTripleChecker+Invalid, 3743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 608 mSolverCounterUnsat, 1104 mSDtfsCounter, 3135 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1207 GetRequests, 1097 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=745occurred in iteration=6, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 1153 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1864 NumberOfCodeBlocks, 1864 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1514 ConstructedInterpolants, 1 QuantifiedInterpolants, 4692 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1109 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 11361/11700 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 04:21:45,102 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_codestructure_steplocals_file-47.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 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:21:47,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:21:47,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:21:47,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:21:47,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:21:47,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:21:47,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:21:47,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:21:47,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:21:47,479 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:21:47,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:21:47,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:21:47,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:21:47,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:21:47,481 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:21:47,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:21:47,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:21:47,482 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:21:47,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:21:47,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:21:47,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:21:47,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:21:47,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:21:47,482 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:21:47,482 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:21:47,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:21:47,482 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:21:47,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:21:47,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:21:47,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:21:47,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:21:47,484 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 -> 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 [2024-11-07 04:21:47,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:21:47,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:21:47,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:21:47,789 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:21:47,789 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:21:47,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2024-11-07 04:21:49,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:21:49,453 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:21:49,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2024-11-07 04:21:49,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3fc9ba6c/a68956b9bbde450591dcf242496144c8/FLAG50d66e861 [2024-11-07 04:21:49,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3fc9ba6c/a68956b9bbde450591dcf242496144c8 [2024-11-07 04:21:49,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:21:49,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:21:49,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:21:49,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:21:49,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:21:49,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d5af7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49, skipping insertion in model container [2024-11-07 04:21:49,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:21:49,648 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_codestructure_steplocals_file-47.i[917,930] [2024-11-07 04:21:49,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:21:49,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:21:49,748 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_codestructure_steplocals_file-47.i[917,930] [2024-11-07 04:21:49,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:21:49,794 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:21:49,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49 WrapperNode [2024-11-07 04:21:49,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:21:49,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:21:49,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:21:49,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:21:49,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,855 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-07 04:21:49,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:21:49,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:21:49,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:21:49,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:21:49,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,884 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 04:21:49,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:21:49,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:21:49,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:21:49,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:21:49,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49" (1/1) ... [2024-11-07 04:21:49,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:21:49,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:21:49,950 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 04:21:49,956 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 04:21:49,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:21:49,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:21:49,973 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:21:49,973 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:21:49,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:21:49,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:21:50,042 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:21:50,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:22:00,933 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 04:22:00,934 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:22:00,966 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:22:00,969 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:22:00,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:22:00 BoogieIcfgContainer [2024-11-07 04:22:00,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:22:00,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:22:00,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:22:00,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:22:00,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:21:49" (1/3) ... [2024-11-07 04:22:00,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ef05c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:22:00, skipping insertion in model container [2024-11-07 04:22:00,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:49" (2/3) ... [2024-11-07 04:22:00,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ef05c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:22:00, skipping insertion in model container [2024-11-07 04:22:00,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:22:00" (3/3) ... [2024-11-07 04:22:00,980 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-47.i [2024-11-07 04:22:00,993 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:22:00,993 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:22:01,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:22:01,062 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;@68d30227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:22:01,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:22:01,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 04:22:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 04:22:01,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:22:01,081 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:22:01,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:22:01,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:22:01,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1746493275, now seen corresponding path program 1 times [2024-11-07 04:22:01,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:22:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489534438] [2024-11-07 04:22:01,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:22:01,100 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 04:22:01,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:22:01,104 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 04:22:01,107 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 04:22:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:22:01,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:22:01,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:22:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2024-11-07 04:22:02,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:22:02,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:22:02,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489534438] [2024-11-07 04:22:02,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489534438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:22:02,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:22:02,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:22:02,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485748899] [2024-11-07 04:22:02,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:22:02,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:22:02,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:22:02,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:22:02,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:22:02,041 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 04:22:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:22:02,071 INFO L93 Difference]: Finished difference Result 141 states and 246 transitions. [2024-11-07 04:22:02,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:22:02,073 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-11-07 04:22:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:22:02,082 INFO L225 Difference]: With dead ends: 141 [2024-11-07 04:22:02,082 INFO L226 Difference]: Without dead ends: 70 [2024-11-07 04:22:02,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 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 04:22:02,091 INFO L432 NwaCegarLoop]: 106 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, 106 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 04:22:02,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:22:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-07 04:22:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-07 04:22:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 04:22:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-07 04:22:02,134 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 164 [2024-11-07 04:22:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:22:02,136 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-07 04:22:02,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 04:22:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-07 04:22:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 04:22:02,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:22:02,139 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:22:02,168 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 (2)] Forceful destruction successful, exit code 0 [2024-11-07 04:22:02,339 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 04:22:02,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:22:02,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:22:02,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1101803117, now seen corresponding path program 1 times [2024-11-07 04:22:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:22:02,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439162888] [2024-11-07 04:22:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:22:02,342 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 04:22:02,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:22:02,345 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 04:22:02,346 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 04:22:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:22:03,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 04:22:03,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:22:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 465 proven. 15 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-07 04:22:04,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:22:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-07 04:22:06,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:22:06,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439162888] [2024-11-07 04:22:06,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439162888] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:22:06,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 04:22:06,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-07 04:22:06,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961427672] [2024-11-07 04:22:06,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 04:22:06,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 04:22:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:22:06,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 04:22:06,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 04:22:06,499 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 04:22:11,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:22:15,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:22:17,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:22:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:22:22,439 INFO L93 Difference]: Finished difference Result 322 states and 481 transitions. [2024-11-07 04:22:22,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 04:22:22,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 164 [2024-11-07 04:22:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:22:22,443 INFO L225 Difference]: With dead ends: 322 [2024-11-07 04:22:22,443 INFO L226 Difference]: Without dead ends: 255 [2024-11-07 04:22:22,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2024-11-07 04:22:22,445 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 240 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 144 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:22:22,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 501 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 525 Invalid, 1 Unknown, 0 Unchecked, 14.2s Time] [2024-11-07 04:22:22,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-07 04:22:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 171. [2024-11-07 04:22:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 94 states have (on average 1.1808510638297873) internal successors, (111), 96 states have internal predecessors, (111), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-07 04:22:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 255 transitions. [2024-11-07 04:22:22,500 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 255 transitions. Word has length 164 [2024-11-07 04:22:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:22:22,501 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 255 transitions. [2024-11-07 04:22:22,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 04:22:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 255 transitions. [2024-11-07 04:22:22,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 04:22:22,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:22:22,505 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:22:22,534 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 04:22:22,706 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 04:22:22,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:22:22,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:22:22,707 INFO L85 PathProgramCache]: Analyzing trace with hash 708776107, now seen corresponding path program 1 times [2024-11-07 04:22:22,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:22:22,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540076253] [2024-11-07 04:22:22,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:22:22,708 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 04:22:22,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:22:22,710 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 04:22:22,711 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 04:22:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:22:23,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 04:22:23,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:22:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-11-07 04:22:29,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:22:31,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:22:31,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540076253] [2024-11-07 04:22:31,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540076253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:22:31,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2121065492] [2024-11-07 04:22:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:22:31,758 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 04:22:31,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 04:22:31,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 04:22:31,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-07 04:22:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:22:33,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 04:22:33,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:22:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-11-07 04:22:38,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:22:39,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2121065492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:22:39,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 04:22:39,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-07 04:22:39,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957640893] [2024-11-07 04:22:39,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 04:22:39,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 04:22:39,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:22:39,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 04:22:39,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-07 04:22:39,767 INFO L87 Difference]: Start difference. First operand 171 states and 255 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 04:22:47,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:22:48,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:22:52,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []