./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-42.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_50-while_file-42.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', '414a4601eebd09cb80a79ffd2e377f75ab51a6dae6dbb936188e57c588481289'] 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_50-while_file-42.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 414a4601eebd09cb80a79ffd2e377f75ab51a6dae6dbb936188e57c588481289 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:53:39,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:53:39,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:53:39,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:53:39,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:53:39,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:53:39,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:53:39,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:53:39,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:53:39,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:53:39,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:53:39,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:53:39,183 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:53:39,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:53:39,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:53:39,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:53:39,184 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 -> 414a4601eebd09cb80a79ffd2e377f75ab51a6dae6dbb936188e57c588481289 [2024-11-07 08:53:39,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:53:39,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:53:39,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:53:39,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:53:39,427 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:53:39,428 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-42.i [2024-11-07 08:53:40,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:53:40,761 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:53:40,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-42.i [2024-11-07 08:53:40,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82a084a42/30b98e480d95456692315068db544485/FLAGf3d158378 [2024-11-07 08:53:40,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82a084a42/30b98e480d95456692315068db544485 [2024-11-07 08:53:40,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:53:40,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:53:40,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:53:40,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:53:40,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:53:40,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:53:40" (1/1) ... [2024-11-07 08:53:40,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20459f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:40, skipping insertion in model container [2024-11-07 08:53:40,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:53:40" (1/1) ... [2024-11-07 08:53:40,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:53:40,898 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_50-while_file-42.i[915,928] [2024-11-07 08:53:40,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:53:40,942 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:53:40,948 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_50-while_file-42.i[915,928] [2024-11-07 08:53:40,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:53:40,976 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:53:40,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:40 WrapperNode [2024-11-07 08:53:40,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:53:40,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:53:40,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:53:40,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:53:40,981 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:53:40" (1/1) ... [2024-11-07 08:53:40,988 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:53:40" (1/1) ... [2024-11-07 08:53:41,026 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-07 08:53:41,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:53:41,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:53:41,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:53:41,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:53:41,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:40" (1/1) ... [2024-11-07 08:53:41,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:40" (1/1) ... [2024-11-07 08:53:41,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:40" (1/1) ... [2024-11-07 08:53:41,058 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:53:41,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:40" (1/1) ... [2024-11-07 08:53:41,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:40" (1/1) ... [2024-11-07 08:53:41,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:40" (1/1) ... [2024-11-07 08:53:41,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:40" (1/1) ... [2024-11-07 08:53:41,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:40" (1/1) ... [2024-11-07 08:53:41,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:40" (1/1) ... [2024-11-07 08:53:41,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:53:41,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:53:41,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:53:41,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:53:41,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:40" (1/1) ... [2024-11-07 08:53:41,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:53:41,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:53:41,115 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:53:41,120 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:53:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:53:41,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:53:41,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:53:41,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:53:41,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:53:41,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:53:41,207 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:53:41,209 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:53:41,495 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-07 08:53:41,496 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:53:41,502 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:53:41,503 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:53:41,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:53:41 BoogieIcfgContainer [2024-11-07 08:53:41,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:53:41,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:53:41,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:53:41,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:53:41,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:53:40" (1/3) ... [2024-11-07 08:53:41,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b96ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:53:41, skipping insertion in model container [2024-11-07 08:53:41,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:40" (2/3) ... [2024-11-07 08:53:41,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b96ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:53:41, skipping insertion in model container [2024-11-07 08:53:41,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:53:41" (3/3) ... [2024-11-07 08:53:41,510 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-42.i [2024-11-07 08:53:41,520 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:53:41,520 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:53:41,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:53:41,576 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;@29107e09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:53:41,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:53:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:53:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 08:53:41,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:41,588 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:41,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:41,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash 992786080, now seen corresponding path program 1 times [2024-11-07 08:53:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:53:41,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105246898] [2024-11-07 08:53:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:41,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:53:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:41,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:53:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:41,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:53:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:41,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:53:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:41,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:53:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:41,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:53:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:41,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:53:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:41,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:53:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:41,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:53:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:41,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:53:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:41,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:53:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:41,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:53:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:53:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:53:41,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:53:41,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105246898] [2024-11-07 08:53:41,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105246898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:41,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:41,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:53:41,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830112896] [2024-11-07 08:53:41,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:41,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:53:41,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:53:41,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:53:41,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:53:41,907 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:53:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:41,925 INFO L93 Difference]: Finished difference Result 99 states and 162 transitions. [2024-11-07 08:53:41,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:53:41,926 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2024-11-07 08:53:41,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:41,931 INFO L225 Difference]: With dead ends: 99 [2024-11-07 08:53:41,931 INFO L226 Difference]: Without dead ends: 49 [2024-11-07 08:53:41,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:53:41,936 INFO L432 NwaCegarLoop]: 71 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, 71 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:53:41,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:53:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-07 08:53:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-07 08:53:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:53:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2024-11-07 08:53:41,965 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 87 [2024-11-07 08:53:41,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:41,966 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2024-11-07 08:53:41,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:53:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2024-11-07 08:53:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 08:53:41,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:41,968 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:41,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:53:41,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:41,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:41,969 INFO L85 PathProgramCache]: Analyzing trace with hash -384634916, now seen corresponding path program 1 times [2024-11-07 08:53:41,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:53:41,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033814239] [2024-11-07 08:53:41,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:53:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:53:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:53:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:53:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:53:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:53:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:53:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:53:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:53:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:53:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:53:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:53:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:53:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:53:42,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:53:42,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033814239] [2024-11-07 08:53:42,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033814239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:42,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:42,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:53:42,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980610428] [2024-11-07 08:53:42,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:42,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:53:42,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:53:42,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:53:42,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:53:42,389 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:42,516 INFO L93 Difference]: Finished difference Result 142 states and 208 transitions. [2024-11-07 08:53:42,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:53:42,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-11-07 08:53:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:42,518 INFO L225 Difference]: With dead ends: 142 [2024-11-07 08:53:42,518 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 08:53:42,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:53:42,519 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 70 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:42,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 195 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:53:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 08:53:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2024-11-07 08:53:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 08:53:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2024-11-07 08:53:42,536 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 87 [2024-11-07 08:53:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:42,536 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2024-11-07 08:53:42,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2024-11-07 08:53:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:53:42,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:42,540 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:42,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:53:42,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:42,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:42,541 INFO L85 PathProgramCache]: Analyzing trace with hash 734981921, now seen corresponding path program 1 times [2024-11-07 08:53:42,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:53:42,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782988116] [2024-11-07 08:53:42,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:42,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:53:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:53:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:53:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:53:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:53:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:53:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:53:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:53:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:53:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:53:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:53:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:53:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:53:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:53:42,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:53:42,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782988116] [2024-11-07 08:53:42,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782988116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:42,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:42,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:53:42,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555823540] [2024-11-07 08:53:42,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:42,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:53:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:53:42,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:53:42,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:53:42,832 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:43,085 INFO L93 Difference]: Finished difference Result 211 states and 311 transitions. [2024-11-07 08:53:43,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:53:43,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-07 08:53:43,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:43,089 INFO L225 Difference]: With dead ends: 211 [2024-11-07 08:53:43,090 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 08:53:43,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:53:43,091 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 100 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:43,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 294 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:53:43,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 08:53:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 119. [2024-11-07 08:53:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 08:53:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2024-11-07 08:53:43,123 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 88 [2024-11-07 08:53:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:43,124 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2024-11-07 08:53:43,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2024-11-07 08:53:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:53:43,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:43,127 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:43,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:53:43,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:43,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:43,128 INFO L85 PathProgramCache]: Analyzing trace with hash -544881757, now seen corresponding path program 1 times [2024-11-07 08:53:43,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:53:43,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703481250] [2024-11-07 08:53:43,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:43,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:53:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:53:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:53:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:53:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:53:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:53:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:53:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:53:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:53:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:53:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:53:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:53:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:53:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:53:43,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:53:43,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703481250] [2024-11-07 08:53:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703481250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:43,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:43,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:53:43,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994579730] [2024-11-07 08:53:43,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:43,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:53:43,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:53:43,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:53:43,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:53:43,291 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:43,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:43,324 INFO L93 Difference]: Finished difference Result 209 states and 308 transitions. [2024-11-07 08:53:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:53:43,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-07 08:53:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:43,328 INFO L225 Difference]: With dead ends: 209 [2024-11-07 08:53:43,330 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 08:53:43,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:53:43,332 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:43,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:53:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 08:53:43,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-07 08:53:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 08:53:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-11-07 08:53:43,344 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 88 [2024-11-07 08:53:43,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:43,344 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-11-07 08:53:43,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-11-07 08:53:43,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:53:43,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:43,346 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:43,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:53:43,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:43,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash 135176613, now seen corresponding path program 1 times [2024-11-07 08:53:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:53:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968532148] [2024-11-07 08:53:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:43,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:53:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:53:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:53:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:53:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:53:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:53:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:53:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:53:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:53:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:53:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:53:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:53:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:53:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-07 08:53:43,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:53:43,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968532148] [2024-11-07 08:53:43,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968532148] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:53:43,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701945756] [2024-11-07 08:53:43,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:43,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:53:43,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:53:43,791 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:53:43,803 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:53:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:43,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 08:53:43,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:53:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-07 08:53:44,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:53:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-07 08:53:44,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701945756] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:53:44,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:53:44,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-07 08:53:44,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619414441] [2024-11-07 08:53:44,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:53:44,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 08:53:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:53:44,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 08:53:44,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-07 08:53:44,335 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 08:53:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:45,106 INFO L93 Difference]: Finished difference Result 382 states and 511 transitions. [2024-11-07 08:53:45,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-07 08:53:45,107 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 88 [2024-11-07 08:53:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:45,110 INFO L225 Difference]: With dead ends: 382 [2024-11-07 08:53:45,110 INFO L226 Difference]: Without dead ends: 336 [2024-11-07 08:53:45,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=482, Invalid=1410, Unknown=0, NotChecked=0, Total=1892 [2024-11-07 08:53:45,114 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 284 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:45,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 446 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:53:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-07 08:53:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 204. [2024-11-07 08:53:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 143 states have internal predecessors, (177), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 08:53:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 273 transitions. [2024-11-07 08:53:45,156 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 273 transitions. Word has length 88 [2024-11-07 08:53:45,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:45,157 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 273 transitions. [2024-11-07 08:53:45,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 08:53:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 273 transitions. [2024-11-07 08:53:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:53:45,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:45,159 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:45,175 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:53:45,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:53:45,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:45,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash -875940637, now seen corresponding path program 1 times [2024-11-07 08:53:45,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:53:45,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548502308] [2024-11-07 08:53:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:53:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:53:45,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [721497063] [2024-11-07 08:53:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:45,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:53:45,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:53:45,397 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:53:45,398 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:53:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:45,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 08:53:45,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:53:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-07 08:53:45,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:53:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:53:46,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548502308] [2024-11-07 08:53:46,124 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 08:53:46,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721497063] [2024-11-07 08:53:46,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721497063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:53:46,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:53:46,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-07 08:53:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905993147] [2024-11-07 08:53:46,125 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 08:53:46,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 08:53:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:53:46,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 08:53:46,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=113, Unknown=3, NotChecked=0, Total=156 [2024-11-07 08:53:46,126 INFO L87 Difference]: Start difference. First operand 204 states and 273 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:53:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:46,600 INFO L93 Difference]: Finished difference Result 618 states and 807 transitions. [2024-11-07 08:53:46,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 08:53:46,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 88 [2024-11-07 08:53:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:46,605 INFO L225 Difference]: With dead ends: 618 [2024-11-07 08:53:46,605 INFO L226 Difference]: Without dead ends: 513 [2024-11-07 08:53:46,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=386, Unknown=3, NotChecked=0, Total=552 [2024-11-07 08:53:46,609 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 120 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:46,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 474 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:53:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-07 08:53:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 424. [2024-11-07 08:53:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 308 states have (on average 1.2402597402597402) internal successors, (382), 310 states have internal predecessors, (382), 88 states have call successors, (88), 27 states have call predecessors, (88), 27 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-07 08:53:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 558 transitions. [2024-11-07 08:53:46,661 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 558 transitions. Word has length 88 [2024-11-07 08:53:46,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:46,662 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 558 transitions. [2024-11-07 08:53:46,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:53:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 558 transitions. [2024-11-07 08:53:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:53:46,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:46,666 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:46,680 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:53:46,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:53:46,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:46,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:46,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1462746651, now seen corresponding path program 1 times [2024-11-07 08:53:46,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:53:46,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157824313] [2024-11-07 08:53:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:46,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:53:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:53:46,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490872951] [2024-11-07 08:53:46,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:46,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:53:46,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:53:46,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:53:46,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 08:53:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:46,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 08:53:46,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:53:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-07 08:53:47,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:53:47,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:53:47,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157824313] [2024-11-07 08:53:47,941 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 08:53:47,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490872951] [2024-11-07 08:53:47,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490872951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:53:47,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:53:47,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-07 08:53:47,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430962504] [2024-11-07 08:53:47,941 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 08:53:47,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 08:53:47,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:53:47,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 08:53:47,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-11-07 08:53:47,943 INFO L87 Difference]: Start difference. First operand 424 states and 558 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:53:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:48,506 INFO L93 Difference]: Finished difference Result 833 states and 1104 transitions. [2024-11-07 08:53:48,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 08:53:48,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 88 [2024-11-07 08:53:48,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:48,510 INFO L225 Difference]: With dead ends: 833 [2024-11-07 08:53:48,510 INFO L226 Difference]: Without dead ends: 672 [2024-11-07 08:53:48,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-11-07 08:53:48,511 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 94 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 34 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:48,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 528 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 421 Invalid, 6 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:53:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-11-07 08:53:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 535. [2024-11-07 08:53:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 387 states have (on average 1.2325581395348837) internal successors, (477), 389 states have internal predecessors, (477), 112 states have call successors, (112), 35 states have call predecessors, (112), 35 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-07 08:53:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 701 transitions. [2024-11-07 08:53:48,574 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 701 transitions. Word has length 88 [2024-11-07 08:53:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:48,574 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 701 transitions. [2024-11-07 08:53:48,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:53:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 701 transitions. [2024-11-07 08:53:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 08:53:48,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:48,575 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:48,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 08:53:48,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:53:48,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:48,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:48,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1226323989, now seen corresponding path program 1 times [2024-11-07 08:53:48,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:53:48,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332060294] [2024-11-07 08:53:48,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:48,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:53:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:53:48,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2096300631] [2024-11-07 08:53:48,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:48,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:53:48,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:53:48,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:53:48,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 08:53:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:53:48,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:53:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:53:48,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:53:48,949 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:53:48,950 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:53:48,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 08:53:49,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-07 08:53:49,157 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:53:49,210 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:53:49,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:53:49 BoogieIcfgContainer [2024-11-07 08:53:49,214 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:53:49,215 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:53:49,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:53:49,215 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:53:49,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:53:41" (3/4) ... [2024-11-07 08:53:49,217 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:53:49,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:53:49,219 INFO L158 Benchmark]: Toolchain (without parser) took 8438.64ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 76.0MB in the beginning and 71.4MB in the end (delta: 4.6MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. [2024-11-07 08:53:49,220 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:53:49,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.61ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 62.2MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:53:49,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.80ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 59.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:53:49,221 INFO L158 Benchmark]: Boogie Preprocessor took 56.88ms. Allocated memory is still 100.7MB. Free memory was 59.0MB in the beginning and 54.2MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:53:49,221 INFO L158 Benchmark]: RCFGBuilder took 418.21ms. Allocated memory is still 100.7MB. Free memory was 54.0MB in the beginning and 73.0MB in the end (delta: -18.9MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-11-07 08:53:49,221 INFO L158 Benchmark]: TraceAbstraction took 7709.54ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 72.1MB in the beginning and 71.5MB in the end (delta: 578.2kB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2024-11-07 08:53:49,221 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 184.5MB. Free memory was 71.5MB in the beginning and 71.4MB in the end (delta: 51.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:53:49,222 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.23ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.61ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 62.2MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.80ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 59.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.88ms. Allocated memory is still 100.7MB. Free memory was 59.0MB in the beginning and 54.2MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 418.21ms. Allocated memory is still 100.7MB. Free memory was 54.0MB in the beginning and 73.0MB in the end (delta: -18.9MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7709.54ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 72.1MB in the beginning and 71.5MB in the end (delta: 578.2kB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 184.5MB. Free memory was 71.5MB in the beginning and 71.4MB in the end (delta: 51.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] signed short int last_1_var_1_1 = 16; [L37] unsigned char last_1_var_1_6 = 10; [L38] unsigned char last_1_var_1_8 = 1; [L39] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L117] last_1_var_1_1 = var_1_1 [L118] last_1_var_1_6 = var_1_6 [L119] last_1_var_1_8 = var_1_8 [L120] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L96] var_1_5 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L97] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L98] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L98] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L100] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L101] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L101] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L104] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L104] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L105] var_1_12 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L106] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L107] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L107] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L108] var_1_15 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L109] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L110] var_1_16 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L111] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L112] var_1_20 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L114] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L114] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L131] RET updateVariables() [L132] CALL step() [L43] signed long int stepLocal_6 = last_1_var_1_1; [L44] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L45] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L46] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L49] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L54] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L57] COND TRUE var_1_5 >= -2 [L58] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L60] unsigned char stepLocal_4 = var_1_6; [L61] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L62] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L63] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L64] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L71] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L72] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L75] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L76] COND TRUE \read(var_1_19) [L77] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L83] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L84] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-2, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L85] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L92] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-2, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L132] RET step() [L133] CALL, EXPR property() [L123-L124] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 8, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 682 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 668 mSDsluCounter, 2134 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1558 mSDsCounter, 263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1272 IncrementalHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 263 mSolverCounterUnsat, 576 mSDtfsCounter, 1272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 699 GetRequests, 599 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=535occurred in iteration=7, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 425 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1056 NumberOfCodeBlocks, 1056 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 781 ConstructedInterpolants, 1 QuantifiedInterpolants, 3320 SizeOfPredicates, 17 NumberOfNonLiveVariables, 693 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 2292/2376 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:53:49,245 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_50-while_file-42.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 414a4601eebd09cb80a79ffd2e377f75ab51a6dae6dbb936188e57c588481289 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:53:51,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:53:51,126 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:53:51,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:53:51,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:53:51,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:53:51,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:53:51,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:53:51,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:53:51,158 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:53:51,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:53:51,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:53:51,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:53:51,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:53:51,159 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:53:51,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:53:51,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:53:51,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:53:51,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:53:51,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:53:51,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:53:51,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:53:51,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:53:51,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:53:51,160 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:53:51,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:53:51,160 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:53:51,160 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:53:51,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:53:51,160 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:53:51,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:53:51,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:53:51,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:53:51,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:53:51,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:53:51,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:53:51,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:53:51,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:53:51,162 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:53:51,162 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:53:51,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:53:51,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:53:51,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:53:51,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:53:51,162 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 -> 414a4601eebd09cb80a79ffd2e377f75ab51a6dae6dbb936188e57c588481289 [2024-11-07 08:53:51,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:53:51,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:53:51,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:53:51,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:53:51,426 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:53:51,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-42.i [2024-11-07 08:53:52,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:53:52,792 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:53:52,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-42.i [2024-11-07 08:53:52,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5942ee10/12a6757439ac40d98b3219b13040ce30/FLAGa10776de0 [2024-11-07 08:53:52,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5942ee10/12a6757439ac40d98b3219b13040ce30 [2024-11-07 08:53:52,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:53:52,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:53:52,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:53:52,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:53:52,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:53:52,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:53:52" (1/1) ... [2024-11-07 08:53:52,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef8995a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:52, skipping insertion in model container [2024-11-07 08:53:52,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:53:52" (1/1) ... [2024-11-07 08:53:52,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:53:52,923 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_50-while_file-42.i[915,928] [2024-11-07 08:53:52,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:53:52,968 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:53:52,975 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_50-while_file-42.i[915,928] [2024-11-07 08:53:52,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:53:53,007 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:53:53,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:53 WrapperNode [2024-11-07 08:53:53,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:53:53,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:53:53,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:53:53,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:53:53,014 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:53:53" (1/1) ... [2024-11-07 08:53:53,020 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:53:53" (1/1) ... [2024-11-07 08:53:53,039 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-07 08:53:53,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:53:53,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:53:53,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:53:53,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:53:53,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:53" (1/1) ... [2024-11-07 08:53:53,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:53" (1/1) ... [2024-11-07 08:53:53,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:53" (1/1) ... [2024-11-07 08:53:53,069 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:53:53,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:53" (1/1) ... [2024-11-07 08:53:53,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:53" (1/1) ... [2024-11-07 08:53:53,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:53" (1/1) ... [2024-11-07 08:53:53,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:53" (1/1) ... [2024-11-07 08:53:53,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:53" (1/1) ... [2024-11-07 08:53:53,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:53" (1/1) ... [2024-11-07 08:53:53,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:53:53,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:53:53,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:53:53,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:53:53,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:53" (1/1) ... [2024-11-07 08:53:53,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:53:53,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:53:53,110 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:53:53,115 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:53:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:53:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:53:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:53:53,129 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:53:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:53:53,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:53:53,193 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:53:53,194 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:53:53,502 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-07 08:53:53,503 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:53:53,509 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:53:53,510 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:53:53,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:53:53 BoogieIcfgContainer [2024-11-07 08:53:53,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:53:53,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:53:53,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:53:53,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:53:53,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:53:52" (1/3) ... [2024-11-07 08:53:53,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221e60f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:53:53, skipping insertion in model container [2024-11-07 08:53:53,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:53" (2/3) ... [2024-11-07 08:53:53,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221e60f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:53:53, skipping insertion in model container [2024-11-07 08:53:53,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:53:53" (3/3) ... [2024-11-07 08:53:53,518 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-42.i [2024-11-07 08:53:53,528 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:53:53,528 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:53:53,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:53:53,583 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;@2e7b6e4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:53:53,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:53:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:53:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 08:53:53,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:53,592 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:53,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:53,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash 992786080, now seen corresponding path program 1 times [2024-11-07 08:53:53,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:53:53,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920530752] [2024-11-07 08:53:53,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:53,602 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:53:53,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:53:53,604 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:53:53,606 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:53:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:53,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:53:53,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:53:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-07 08:53:53,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:53:53,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:53:53,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920530752] [2024-11-07 08:53:53,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920530752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:53,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:53,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:53:53,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137006772] [2024-11-07 08:53:53,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:53,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:53:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:53:53,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:53:53,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:53:53,831 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:53:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:53,848 INFO L93 Difference]: Finished difference Result 99 states and 162 transitions. [2024-11-07 08:53:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:53:53,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2024-11-07 08:53:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:53,856 INFO L225 Difference]: With dead ends: 99 [2024-11-07 08:53:53,856 INFO L226 Difference]: Without dead ends: 49 [2024-11-07 08:53:53,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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:53:53,862 INFO L432 NwaCegarLoop]: 71 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, 71 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:53:53,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:53:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-07 08:53:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-07 08:53:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:53:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2024-11-07 08:53:53,895 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 87 [2024-11-07 08:53:53,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:53,895 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2024-11-07 08:53:53,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:53:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2024-11-07 08:53:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 08:53:53,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:53,899 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:53,910 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:53:54,100 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:53:54,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:54,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash -384634916, now seen corresponding path program 1 times [2024-11-07 08:53:54,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:53:54,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326669303] [2024-11-07 08:53:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:54,103 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:53:54,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:53:54,106 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:53:54,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 08:53:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:54,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 08:53:54,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:53:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:53:54,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:53:54,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:53:54,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326669303] [2024-11-07 08:53:54,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326669303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:54,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:54,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:53:54,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498145972] [2024-11-07 08:53:54,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:54,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:53:54,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:53:54,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:53:54,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:53:54,454 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:54,683 INFO L93 Difference]: Finished difference Result 142 states and 208 transitions. [2024-11-07 08:53:54,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:53:54,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-11-07 08:53:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:54,690 INFO L225 Difference]: With dead ends: 142 [2024-11-07 08:53:54,690 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 08:53:54,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:53:54,691 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 67 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:54,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 195 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:53:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 08:53:54,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2024-11-07 08:53:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 08:53:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2024-11-07 08:53:54,710 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 87 [2024-11-07 08:53:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:54,711 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2024-11-07 08:53:54,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2024-11-07 08:53:54,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:53:54,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:54,713 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:54,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 08:53:54,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:53:54,914 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:54,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:54,914 INFO L85 PathProgramCache]: Analyzing trace with hash 734981921, now seen corresponding path program 1 times [2024-11-07 08:53:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:53:54,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413881210] [2024-11-07 08:53:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:54,915 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:53:54,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:53:54,917 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:53:54,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 08:53:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:55,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 08:53:55,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:53:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:53:55,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:53:55,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:53:55,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413881210] [2024-11-07 08:53:55,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413881210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:55,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:55,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:53:55,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966355299] [2024-11-07 08:53:55,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:55,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:53:55,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:53:55,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:53:55,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:53:55,364 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:55,877 INFO L93 Difference]: Finished difference Result 211 states and 311 transitions. [2024-11-07 08:53:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:53:55,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-07 08:53:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:55,883 INFO L225 Difference]: With dead ends: 211 [2024-11-07 08:53:55,883 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 08:53:55,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:53:55,885 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 97 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:55,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 294 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 08:53:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 08:53:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 119. [2024-11-07 08:53:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 08:53:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2024-11-07 08:53:55,900 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 88 [2024-11-07 08:53:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:55,901 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2024-11-07 08:53:55,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2024-11-07 08:53:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:53:55,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:55,902 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:55,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 08:53:56,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:53:56,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:56,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:56,103 INFO L85 PathProgramCache]: Analyzing trace with hash -544881757, now seen corresponding path program 1 times [2024-11-07 08:53:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:53:56,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732706506] [2024-11-07 08:53:56,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:56,103 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:53:56,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:53:56,107 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:53:56,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 08:53:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:56,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 08:53:56,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:53:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:53:56,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:53:56,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:53:56,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732706506] [2024-11-07 08:53:56,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732706506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:56,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:56,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:53:56,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401705587] [2024-11-07 08:53:56,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:56,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:53:56,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:53:56,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:53:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:53:56,247 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:56,326 INFO L93 Difference]: Finished difference Result 209 states and 308 transitions. [2024-11-07 08:53:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:53:56,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-07 08:53:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:56,332 INFO L225 Difference]: With dead ends: 209 [2024-11-07 08:53:56,332 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 08:53:56,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:53:56,333 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:56,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:53:56,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 08:53:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-07 08:53:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 08:53:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-11-07 08:53:56,353 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 88 [2024-11-07 08:53:56,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:56,353 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-11-07 08:53:56,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:56,353 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-11-07 08:53:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:53:56,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:56,354 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:56,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 08:53:56,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:53:56,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:56,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 135176613, now seen corresponding path program 1 times [2024-11-07 08:53:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:53:56,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239234788] [2024-11-07 08:53:56,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:56,560 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:53:56,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:53:56,564 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:53:56,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 08:53:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:56,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 08:53:56,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:53:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-07 08:53:56,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:53:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-07 08:53:57,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:53:57,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239234788] [2024-11-07 08:53:57,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239234788] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:53:57,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:53:57,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-07 08:53:57,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915345122] [2024-11-07 08:53:57,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:53:57,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 08:53:57,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:53:57,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 08:53:57,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:53:57,053 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 08:53:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:57,784 INFO L93 Difference]: Finished difference Result 276 states and 367 transitions. [2024-11-07 08:53:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 08:53:57,785 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 88 [2024-11-07 08:53:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:57,786 INFO L225 Difference]: With dead ends: 276 [2024-11-07 08:53:57,786 INFO L226 Difference]: Without dead ends: 230 [2024-11-07 08:53:57,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 08:53:57,788 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 151 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:57,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 375 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 08:53:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-07 08:53:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 204. [2024-11-07 08:53:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 143 states have internal predecessors, (177), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 08:53:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 273 transitions. [2024-11-07 08:53:57,819 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 273 transitions. Word has length 88 [2024-11-07 08:53:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:57,819 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 273 transitions. [2024-11-07 08:53:57,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 08:53:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 273 transitions. [2024-11-07 08:53:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:53:57,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:57,820 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:57,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 08:53:58,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:53:58,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:58,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:58,024 INFO L85 PathProgramCache]: Analyzing trace with hash -875940637, now seen corresponding path program 1 times [2024-11-07 08:53:58,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:53:58,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473550838] [2024-11-07 08:53:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:58,024 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:53:58,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:53:58,026 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:53:58,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 08:53:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:58,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 08:53:58,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:53:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-07 08:53:58,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:53:58,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:53:58,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473550838] [2024-11-07 08:53:58,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473550838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:53:58,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2098215615] [2024-11-07 08:53:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:58,762 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 08:53:58,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 08:53:58,765 INFO L229 MonitoredProcess]: Starting monitored process 8 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:53:58,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-07 08:53:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:59,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 08:53:59,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:53:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:53:59,457 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:53:59,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2098215615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:59,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:53:59,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-07 08:53:59,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6631266] [2024-11-07 08:53:59,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:59,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:53:59,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:53:59,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:53:59,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:53:59,459 INFO L87 Difference]: Start difference. First operand 204 states and 273 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:54:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:54:00,697 INFO L93 Difference]: Finished difference Result 586 states and 779 transitions. [2024-11-07 08:54:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 08:54:00,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-07 08:54:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:54:00,706 INFO L225 Difference]: With dead ends: 586 [2024-11-07 08:54:00,706 INFO L226 Difference]: Without dead ends: 481 [2024-11-07 08:54:00,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-07 08:54:00,707 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 115 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:54:00,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 334 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 08:54:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-07 08:54:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 408. [2024-11-07 08:54:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 296 states have (on average 1.25) internal successors, (370), 298 states have internal predecessors, (370), 88 states have call successors, (88), 23 states have call predecessors, (88), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-07 08:54:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 546 transitions. [2024-11-07 08:54:00,752 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 546 transitions. Word has length 88 [2024-11-07 08:54:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:54:00,753 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 546 transitions. [2024-11-07 08:54:00,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:54:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 546 transitions. [2024-11-07 08:54:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:54:00,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:54:00,754 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:00,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 08:54:00,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-07 08:54:01,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 08:54:01,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:54:01,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:54:01,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1462746651, now seen corresponding path program 1 times [2024-11-07 08:54:01,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:54:01,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871834795] [2024-11-07 08:54:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:54:01,160 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:54:01,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:54:01,162 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:54:01,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 08:54:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:54:01,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 08:54:01,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:54:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-07 08:54:01,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:54:01,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:54:01,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871834795] [2024-11-07 08:54:01,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871834795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:54:01,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1832409351] [2024-11-07 08:54:01,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:54:01,954 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 08:54:01,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 08:54:01,956 INFO L229 MonitoredProcess]: Starting monitored process 10 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:54:01,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-07 08:54:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:54:02,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 08:54:02,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:54:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:54:02,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:54:02,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1832409351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:54:02,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:54:02,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-07 08:54:02,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937260375] [2024-11-07 08:54:02,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:54:02,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:54:02,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:54:02,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:54:02,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:54:02,724 INFO L87 Difference]: Start difference. First operand 408 states and 546 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:54:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:54:03,767 INFO L93 Difference]: Finished difference Result 714 states and 956 transitions. [2024-11-07 08:54:03,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:54:03,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-07 08:54:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:54:03,772 INFO L225 Difference]: With dead ends: 714 [2024-11-07 08:54:03,772 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 08:54:03,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-07 08:54:03,773 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 66 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 08:54:03,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 278 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 08:54:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 08:54:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 511. [2024-11-07 08:54:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 369 states have (on average 1.2439024390243902) internal successors, (459), 371 states have internal predecessors, (459), 112 states have call successors, (112), 29 states have call predecessors, (112), 29 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-07 08:54:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 683 transitions. [2024-11-07 08:54:03,829 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 683 transitions. Word has length 88 [2024-11-07 08:54:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:54:03,829 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 683 transitions. [2024-11-07 08:54:03,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:54:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 683 transitions. [2024-11-07 08:54:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 08:54:03,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:54:03,832 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:03,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 08:54:04,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-07 08:54:04,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 08:54:04,232 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:54:04,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:54:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1226323989, now seen corresponding path program 1 times [2024-11-07 08:54:04,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:54:04,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568383369] [2024-11-07 08:54:04,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:54:04,233 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:54:04,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:54:04,235 INFO L229 MonitoredProcess]: Starting monitored process 11 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:54:04,236 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 (11)] Waiting until timeout for monitored process [2024-11-07 08:54:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:54:04,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 08:54:04,351 INFO L278 TraceCheckSpWp]: Computing forward predicates...