./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.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_loopvsstraightlinecode_25-1loop_file-31.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', 'edefa3ede03a09b2efca71b139c957891dc8e0f1d7994a4b8237a639ffd3afb0'] 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_loopvsstraightlinecode_25-1loop_file-31.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 edefa3ede03a09b2efca71b139c957891dc8e0f1d7994a4b8237a639ffd3afb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:19:14,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:19:14,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:19:14,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:19:14,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:19:14,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:19:14,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:19:14,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:19:14,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:19:14,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:19:14,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:19:14,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:19:14,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:19:14,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:19:14,636 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:19:14,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:19:14,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:19:14,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:19:14,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:19:14,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:19:14,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:19:14,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:19:14,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:19:14,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:19:14,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:19:14,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:19:14,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:19:14,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:19:14,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:19:14,639 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 -> edefa3ede03a09b2efca71b139c957891dc8e0f1d7994a4b8237a639ffd3afb0 [2024-11-07 08:19:14,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:19:14,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:19:14,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:19:14,921 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:19:14,921 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:19:14,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i [2024-11-07 08:19:16,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:19:16,483 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:19:16,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i [2024-11-07 08:19:16,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0aa2776d0/caed769088914db294b238f95027d9ae/FLAG2ecf2113b [2024-11-07 08:19:16,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0aa2776d0/caed769088914db294b238f95027d9ae [2024-11-07 08:19:16,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:19:16,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:19:16,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:19:16,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:19:16,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:19:16,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:16" (1/1) ... [2024-11-07 08:19:16,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304c0473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:16, skipping insertion in model container [2024-11-07 08:19:16,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:16" (1/1) ... [2024-11-07 08:19:16,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:19:16,941 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_loopvsstraightlinecode_25-1loop_file-31.i[915,928] [2024-11-07 08:19:16,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:19:17,002 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:19:17,012 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_loopvsstraightlinecode_25-1loop_file-31.i[915,928] [2024-11-07 08:19:17,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:19:17,046 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:19:17,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17 WrapperNode [2024-11-07 08:19:17,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:19:17,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:19:17,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:19:17,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:19:17,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17" (1/1) ... [2024-11-07 08:19:17,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17" (1/1) ... [2024-11-07 08:19:17,099 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-07 08:19:17,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:19:17,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:19:17,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:19:17,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:19:17,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17" (1/1) ... [2024-11-07 08:19:17,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17" (1/1) ... [2024-11-07 08:19:17,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17" (1/1) ... [2024-11-07 08:19:17,146 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 08:19:17,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17" (1/1) ... [2024-11-07 08:19:17,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17" (1/1) ... [2024-11-07 08:19:17,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17" (1/1) ... [2024-11-07 08:19:17,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17" (1/1) ... [2024-11-07 08:19:17,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17" (1/1) ... [2024-11-07 08:19:17,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17" (1/1) ... [2024-11-07 08:19:17,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:19:17,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:19:17,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:19:17,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:19:17,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17" (1/1) ... [2024-11-07 08:19:17,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:19:17,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:19:17,215 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 08:19:17,223 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 08:19:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:19:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:19:17,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:19:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:19:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:19:17,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:19:17,343 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:19:17,345 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:19:17,675 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 08:19:17,675 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:19:17,691 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:19:17,692 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:19:17,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:17 BoogieIcfgContainer [2024-11-07 08:19:17,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:19:17,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:19:17,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:19:17,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:19:17,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:19:16" (1/3) ... [2024-11-07 08:19:17,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5cc73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:17, skipping insertion in model container [2024-11-07 08:19:17,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:17" (2/3) ... [2024-11-07 08:19:17,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5cc73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:17, skipping insertion in model container [2024-11-07 08:19:17,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:17" (3/3) ... [2024-11-07 08:19:17,703 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-31.i [2024-11-07 08:19:17,716 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:19:17,717 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:19:17,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:19:17,788 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;@73eda56e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:19:17,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:19:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 08:19:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 08:19:17,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:17,805 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:17,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:17,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash -298760130, now seen corresponding path program 1 times [2024-11-07 08:19:17,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:17,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43039042] [2024-11-07 08:19:17,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:17,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:18,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:18,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:18,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:18,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:18,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:19:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:18,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:19:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:18,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:19:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:19:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:18,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:19:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:18,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:19:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 08:19:18,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:18,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43039042] [2024-11-07 08:19:18,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43039042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:18,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:18,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:19:18,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610062451] [2024-11-07 08:19:18,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:18,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:19:18,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:18,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:19:18,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:19:18,229 INFO L87 Difference]: Start difference. First operand has 57 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 08:19:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:18,252 INFO L93 Difference]: Finished difference Result 111 states and 174 transitions. [2024-11-07 08:19:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:19:18,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2024-11-07 08:19:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:18,260 INFO L225 Difference]: With dead ends: 111 [2024-11-07 08:19:18,260 INFO L226 Difference]: Without dead ends: 53 [2024-11-07 08:19:18,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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 08:19:18,266 INFO L432 NwaCegarLoop]: 80 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, 80 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 08:19:18,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:19:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-07 08:19:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-07 08:19:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 08:19:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-11-07 08:19:18,313 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 77 [2024-11-07 08:19:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:18,313 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-11-07 08:19:18,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 08:19:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-11-07 08:19:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 08:19:18,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:18,316 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:18,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:19:18,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:18,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:18,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1753793024, now seen corresponding path program 1 times [2024-11-07 08:19:18,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:18,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995265220] [2024-11-07 08:19:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:18,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:19:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:19:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:19:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:19:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:19:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:19:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 08:19:19,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:19,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995265220] [2024-11-07 08:19:19,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995265220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:19,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:19,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:19:19,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998047078] [2024-11-07 08:19:19,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:19,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:19:19,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:19,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:19:19,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:19:19,398 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 08:19:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:19,697 INFO L93 Difference]: Finished difference Result 159 states and 224 transitions. [2024-11-07 08:19:19,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:19:19,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 77 [2024-11-07 08:19:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:19,703 INFO L225 Difference]: With dead ends: 159 [2024-11-07 08:19:19,703 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 08:19:19,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:19:19,704 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 73 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:19,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 276 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:19:19,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 08:19:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2024-11-07 08:19:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 69 states have internal predecessors, (90), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 08:19:19,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2024-11-07 08:19:19,733 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 77 [2024-11-07 08:19:19,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:19,735 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2024-11-07 08:19:19,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 08:19:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2024-11-07 08:19:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 08:19:19,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:19,738 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:19,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:19:19,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:19,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1073734654, now seen corresponding path program 1 times [2024-11-07 08:19:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:19,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172494661] [2024-11-07 08:19:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:20,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:20,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:20,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:20,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:20,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:20,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:19:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:20,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:19:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:20,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:19:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:20,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:19:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:20,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:19:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:20,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:19:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 08:19:20,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:20,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172494661] [2024-11-07 08:19:20,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172494661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:20,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:20,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:19:20,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839442703] [2024-11-07 08:19:20,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:20,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:19:20,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:20,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:19:20,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:19:20,225 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 08:19:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:20,455 INFO L93 Difference]: Finished difference Result 208 states and 294 transitions. [2024-11-07 08:19:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:19:20,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 77 [2024-11-07 08:19:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:20,459 INFO L225 Difference]: With dead ends: 208 [2024-11-07 08:19:20,459 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 08:19:20,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:19:20,464 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 47 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:20,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 258 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:19:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 08:19:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 93. [2024-11-07 08:19:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 72 states have internal predecessors, (93), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 08:19:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-11-07 08:19:20,483 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 77 [2024-11-07 08:19:20,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:20,483 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-11-07 08:19:20,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 08:19:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-11-07 08:19:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 08:19:20,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:20,485 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:20,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:19:20,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:20,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1129951385, now seen corresponding path program 1 times [2024-11-07 08:19:20,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:20,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877884826] [2024-11-07 08:19:20,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:20,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:19:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:19:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:19:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:19:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:19:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:19:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 08:19:21,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:21,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877884826] [2024-11-07 08:19:21,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877884826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:21,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:21,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:19:21,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882040823] [2024-11-07 08:19:21,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:21,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:19:21,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:21,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:19:21,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:19:21,085 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 08:19:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:21,331 INFO L93 Difference]: Finished difference Result 202 states and 281 transitions. [2024-11-07 08:19:21,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 08:19:21,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2024-11-07 08:19:21,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:21,334 INFO L225 Difference]: With dead ends: 202 [2024-11-07 08:19:21,334 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 08:19:21,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:19:21,335 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 100 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:21,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 265 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:19:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 08:19:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 90. [2024-11-07 08:19:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 69 states have internal predecessors, (89), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 08:19:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-11-07 08:19:21,355 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 78 [2024-11-07 08:19:21,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:21,355 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-11-07 08:19:21,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 08:19:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-11-07 08:19:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 08:19:21,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:21,361 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:21,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:19:21,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:21,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash 736924375, now seen corresponding path program 1 times [2024-11-07 08:19:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:21,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889819112] [2024-11-07 08:19:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:21,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:19:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:19:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:19:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:19:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:19:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:19:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 08:19:21,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:21,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889819112] [2024-11-07 08:19:21,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889819112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:21,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:21,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:19:21,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016192212] [2024-11-07 08:19:21,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:21,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:19:21,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:21,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:19:21,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:19:21,842 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 08:19:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:22,095 INFO L93 Difference]: Finished difference Result 208 states and 291 transitions. [2024-11-07 08:19:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:19:22,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2024-11-07 08:19:22,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:22,099 INFO L225 Difference]: With dead ends: 208 [2024-11-07 08:19:22,101 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 08:19:22,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:19:22,102 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 89 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:22,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 242 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:19:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 08:19:22,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 87. [2024-11-07 08:19:22,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 08:19:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-11-07 08:19:22,120 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 78 [2024-11-07 08:19:22,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:22,120 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-11-07 08:19:22,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 08:19:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-11-07 08:19:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 08:19:22,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:22,125 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:22,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:19:22,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:22,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:22,126 INFO L85 PathProgramCache]: Analyzing trace with hash -710760677, now seen corresponding path program 1 times [2024-11-07 08:19:22,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:22,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941383666] [2024-11-07 08:19:22,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:22,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:19:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078265480] [2024-11-07 08:19:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:22,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:19:22,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:19:22,175 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 08:19:22,177 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 08:19:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:22,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 08:19:22,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:19:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-07 08:19:22,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:19:22,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941383666] [2024-11-07 08:19:22,914 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 08:19:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078265480] [2024-11-07 08:19:22,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078265480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:19:22,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:19:22,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-07 08:19:22,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695178468] [2024-11-07 08:19:22,915 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 08:19:22,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:19:22,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:22,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:19:22,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=79, Unknown=1, NotChecked=0, Total=110 [2024-11-07 08:19:22,917 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 08:19:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:23,262 INFO L93 Difference]: Finished difference Result 234 states and 326 transitions. [2024-11-07 08:19:23,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 08:19:23,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2024-11-07 08:19:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:23,266 INFO L225 Difference]: With dead ends: 234 [2024-11-07 08:19:23,266 INFO L226 Difference]: Without dead ends: 150 [2024-11-07 08:19:23,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=239, Unknown=1, NotChecked=0, Total=342 [2024-11-07 08:19:23,267 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 103 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:23,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 305 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 131 Invalid, 2 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:19:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-07 08:19:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2024-11-07 08:19:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 91 states have internal predecessors, (115), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 08:19:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 175 transitions. [2024-11-07 08:19:23,299 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 175 transitions. Word has length 79 [2024-11-07 08:19:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:23,299 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 175 transitions. [2024-11-07 08:19:23,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 08:19:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 175 transitions. [2024-11-07 08:19:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 08:19:23,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:23,305 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:23,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 08:19:23,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:19:23,507 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:23,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:23,508 INFO L85 PathProgramCache]: Analyzing trace with hash -9696099, now seen corresponding path program 1 times [2024-11-07 08:19:23,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:23,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557676704] [2024-11-07 08:19:23,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:23,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:19:23,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1268098592] [2024-11-07 08:19:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:23,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:19:23,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:19:23,557 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 08:19:23,560 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 08:19:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:19:23,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:19:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:19:23,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:19:23,746 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:19:23,747 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:19:23,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 08:19:23,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:19:23,954 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:19:24,040 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:19:24,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:19:24 BoogieIcfgContainer [2024-11-07 08:19:24,047 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:19:24,048 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:19:24,048 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:19:24,048 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:19:24,049 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:17" (3/4) ... [2024-11-07 08:19:24,052 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:19:24,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:19:24,054 INFO L158 Benchmark]: Toolchain (without parser) took 7276.21ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.9MB in the beginning and 68.5MB in the end (delta: 23.5MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2024-11-07 08:19:24,057 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:19:24,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.09ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 79.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:19:24,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.48ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 76.8MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:19:24,058 INFO L158 Benchmark]: Boogie Preprocessor took 69.04ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 74.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:19:24,058 INFO L158 Benchmark]: RCFGBuilder took 522.78ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 56.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:19:24,058 INFO L158 Benchmark]: TraceAbstraction took 6352.38ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 55.9MB in the beginning and 68.5MB in the end (delta: -12.6MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-11-07 08:19:24,058 INFO L158 Benchmark]: Witness Printer took 5.30ms. Allocated memory is still 159.4MB. Free memory was 68.5MB in the beginning and 68.5MB in the end (delta: 57.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:19:24,060 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.09ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 79.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.48ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 76.8MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.04ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 74.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 522.78ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 56.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6352.38ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 55.9MB in the beginning and 68.5MB in the end (delta: -12.6MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * Witness Printer took 5.30ms. Allocated memory is still 159.4MB. Free memory was 68.5MB in the beginning and 68.5MB in the end (delta: 57.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 200; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1107940323; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 16; [L28] unsigned char var_1_9 = 16; [L29] unsigned short int var_1_10 = 4; [L30] double var_1_11 = 1000000.5; [L31] double var_1_12 = 1.25; [L32] signed long int last_1_var_1_1 = 200; [L33] unsigned char last_1_var_1_8 = 16; [L34] unsigned short int last_1_var_1_10 = 4; VAL [isInitial=0, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L91] isInitial = 1 [L92] FCALL initially() [L93] int k_loop; [L94] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L94] COND TRUE k_loop < 1 [L95] CALL updateLastVariables() [L82] last_1_var_1_1 = var_1_1 [L83] last_1_var_1_8 = var_1_8 [L84] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L95] RET updateLastVariables() [L96] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L66] var_1_3 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L67] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L68] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L68] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=0, var_1_8=16, var_1_9=16] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=0, var_1_8=16, var_1_9=16] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_8=16, var_1_9=16] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_8=16, var_1_9=16] [L74] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=16] [L74] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=16] [L75] var_1_9 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16] [L77] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L78] var_1_12 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L79] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L96] RET updateVariables() [L97] CALL step() [L38] signed long int stepLocal_2 = last_1_var_1_8; [L39] signed long int stepLocal_1 = var_1_3 * last_1_var_1_8; VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_1=17179869152, stepLocal_2=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L40] COND TRUE stepLocal_1 >= last_1_var_1_1 [L41] var_1_10 = (2 + var_1_9) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L49] signed long int stepLocal_0 = last_1_var_1_10 / var_1_3; VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_0=0, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L50] COND FALSE !(stepLocal_0 >= (500 - last_1_var_1_10)) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L53] COND TRUE \read(var_1_2) [L54] var_1_1 = ((var_1_3 - var_1_10) - var_1_8) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L60] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L97] RET step() [L98] CALL, EXPR property() [L87] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L87] EXPR ((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L87] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L87-L88] return (((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1))))) && (var_1_11 == ((double) var_1_12)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 412 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 412 mSDsluCounter, 1426 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 959 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 426 IncrementalHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 467 mSDtfsCounter, 426 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 127 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 703 NumberOfCodeBlocks, 703 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 460 ConstructedInterpolants, 1 QuantifiedInterpolants, 1486 SizeOfPredicates, 3 NumberOfNonLiveVariables, 202 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 1296/1320 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 08:19:24,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.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 edefa3ede03a09b2efca71b139c957891dc8e0f1d7994a4b8237a639ffd3afb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:19:26,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:19:26,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:19:26,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:19:26,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:19:26,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:19:26,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:19:26,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:19:26,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:19:26,797 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:19:26,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:19:26,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:19:26,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:19:26,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:19:26,797 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:19:26,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:19:26,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:19:26,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:19:26,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:19:26,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:19:26,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:19:26,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:19:26,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:19:26,799 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:19:26,799 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:19:26,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:19:26,799 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:19:26,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:19:26,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:19:26,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:19:26,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:19:26,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:19:26,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:19:26,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:19:26,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:19:26,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:19:26,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:19:26,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:19:26,802 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:19:26,802 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:19:26,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:19:26,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:19:26,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:19:26,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:19:26,803 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 -> edefa3ede03a09b2efca71b139c957891dc8e0f1d7994a4b8237a639ffd3afb0 [2024-11-07 08:19:27,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:19:27,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:19:27,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:19:27,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:19:27,145 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:19:27,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i [2024-11-07 08:19:28,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:19:28,870 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:19:28,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i [2024-11-07 08:19:28,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42afea70e/fe636de847e84debbdbae745e611681c/FLAG73830cfab [2024-11-07 08:19:29,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42afea70e/fe636de847e84debbdbae745e611681c [2024-11-07 08:19:29,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:19:29,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:19:29,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:19:29,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:19:29,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:19:29,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65fcd976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29, skipping insertion in model container [2024-11-07 08:19:29,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:19:29,333 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_loopvsstraightlinecode_25-1loop_file-31.i[915,928] [2024-11-07 08:19:29,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:19:29,391 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:19:29,403 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_loopvsstraightlinecode_25-1loop_file-31.i[915,928] [2024-11-07 08:19:29,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:19:29,435 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:19:29,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29 WrapperNode [2024-11-07 08:19:29,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:19:29,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:19:29,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:19:29,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:19:29,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,475 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-11-07 08:19:29,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:19:29,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:19:29,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:19:29,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:19:29,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,514 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 08:19:29,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,528 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:19:29,545 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:19:29,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:19:29,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:19:29,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29" (1/1) ... [2024-11-07 08:19:29,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:19:29,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:19:29,578 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 08:19:29,581 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 08:19:29,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:19:29,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:19:29,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:19:29,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:19:29,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:19:29,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:19:29,689 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:19:29,691 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:19:30,008 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-07 08:19:30,009 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:19:30,017 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:19:30,017 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:19:30,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:30 BoogieIcfgContainer [2024-11-07 08:19:30,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:19:30,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:19:30,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:19:30,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:19:30,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:19:29" (1/3) ... [2024-11-07 08:19:30,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddd7add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:30, skipping insertion in model container [2024-11-07 08:19:30,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:29" (2/3) ... [2024-11-07 08:19:30,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddd7add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:30, skipping insertion in model container [2024-11-07 08:19:30,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:30" (3/3) ... [2024-11-07 08:19:30,030 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-31.i [2024-11-07 08:19:30,045 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:19:30,046 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:19:30,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:19:30,100 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;@5be7d14c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:19:30,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:19:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 08:19:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 08:19:30,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:30,112 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:30,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:30,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash 719468721, now seen corresponding path program 1 times [2024-11-07 08:19:30,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:19:30,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078021144] [2024-11-07 08:19:30,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:30,124 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 08:19:30,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:19:30,144 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 08:19:30,147 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 08:19:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:30,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:19:30,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:19:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-07 08:19:30,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:19:30,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:19:30,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078021144] [2024-11-07 08:19:30,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078021144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:30,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:30,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:19:30,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550545663] [2024-11-07 08:19:30,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:30,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:19:30,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:19:30,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:19:30,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:19:30,417 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 08:19:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:30,442 INFO L93 Difference]: Finished difference Result 85 states and 132 transitions. [2024-11-07 08:19:30,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:19:30,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2024-11-07 08:19:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:30,450 INFO L225 Difference]: With dead ends: 85 [2024-11-07 08:19:30,450 INFO L226 Difference]: Without dead ends: 40 [2024-11-07 08:19:30,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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 08:19:30,458 INFO L432 NwaCegarLoop]: 59 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, 59 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 08:19:30,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:19:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-07 08:19:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-07 08:19:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 08:19:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2024-11-07 08:19:30,503 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 75 [2024-11-07 08:19:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:30,504 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2024-11-07 08:19:30,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 08:19:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2024-11-07 08:19:30,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 08:19:30,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:30,508 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:30,518 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 08:19:30,709 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 08:19:30,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:30,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:30,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1118914829, now seen corresponding path program 1 times [2024-11-07 08:19:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:19:30,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146134621] [2024-11-07 08:19:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:30,713 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 08:19:30,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:19:30,716 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 08:19:30,719 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 08:19:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:30,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 08:19:30,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:19:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 130 proven. 18 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-07 08:19:44,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:20:08,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:20:08,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146134621] [2024-11-07 08:20:08,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146134621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:20:08,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1624979906] [2024-11-07 08:20:08,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:08,980 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 08:20:08,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 08:20:08,992 INFO L229 MonitoredProcess]: Starting monitored process 4 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 08:20:08,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-07 08:20:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:09,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 08:20:09,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:20:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-07 08:20:24,094 INFO L311 TraceCheckSpWp]: Computing backward predicates...