./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/loops/string-2.i --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/string-2.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26998269 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/loops/string-2.i ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/string-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m [2024-08-14 14:30:19,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:30:19,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-14 14:30:19,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:30:19,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:30:19,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:30:19,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:30:19,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:30:19,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:30:19,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:30:19,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:30:19,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:30:19,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:30:19,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:30:19,781 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:30:19,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:30:19,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:30:19,788 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-14 14:30:19,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:30:19,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-14 14:30:19,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:30:19,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:30:19,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:30:19,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:30:19,790 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:30:19,790 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-14 14:30:19,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:30:19,790 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:30:19,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:30:19,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:30:19,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:30:19,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:30:19,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:30:19,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:30:19,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:30:19,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:30:19,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:30:19,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:30:19,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:30:19,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:30:19,795 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:30:19,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:30:19,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:30:19,796 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:30:20,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:30:20,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:30:20,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:30:20,095 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:30:20,095 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:30:20,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/string-2.yml/witness.yml [2024-08-14 14:30:20,174 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:30:20,174 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:30:20,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-2.i [2024-08-14 14:30:21,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:30:21,793 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:30:21,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i [2024-08-14 14:30:21,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab64083b/577db8309fc74d4b99b153b15f3910a4/FLAGd4bcae164 [2024-08-14 14:30:21,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab64083b/577db8309fc74d4b99b153b15f3910a4 [2024-08-14 14:30:21,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:30:21,815 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:30:21,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:30:21,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:30:21,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:30:21,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:30:20" (1/2) ... [2024-08-14 14:30:21,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5679f3d5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:21, skipping insertion in model container [2024-08-14 14:30:21,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:30:20" (1/2) ... [2024-08-14 14:30:21,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@65547872 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:21, skipping insertion in model container [2024-08-14 14:30:21,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:30:21" (2/2) ... [2024-08-14 14:30:21,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5679f3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:21, skipping insertion in model container [2024-08-14 14:30:21,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:30:21" (2/2) ... [2024-08-14 14:30:21,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:30:21,989 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i[896,909] [2024-08-14 14:30:22,014 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:30:22,023 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:30:22,037 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i[896,909] [2024-08-14 14:30:22,046 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:30:22,066 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:30:22,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:22 WrapperNode [2024-08-14 14:30:22,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:30:22,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:30:22,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:30:22,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:30:22,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:22" (1/1) ... [2024-08-14 14:30:22,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:22" (1/1) ... [2024-08-14 14:30:22,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:22" (1/1) ... [2024-08-14 14:30:22,122 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-08-14 14:30:22,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:22" (1/1) ... [2024-08-14 14:30:22,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:22" (1/1) ... [2024-08-14 14:30:22,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:22" (1/1) ... [2024-08-14 14:30:22,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:22" (1/1) ... [2024-08-14 14:30:22,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:22" (1/1) ... [2024-08-14 14:30:22,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:30:22,146 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:30:22,147 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:30:22,147 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:30:22,148 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:22" (1/1) ... [2024-08-14 14:30:22,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:30:22,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:30:22,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:30:22,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:30:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:30:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:30:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:30:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:30:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:30:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:30:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:30:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:30:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2024-08-14 14:30:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2024-08-14 14:30:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:30:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:30:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:30:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:30:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2024-08-14 14:30:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:30:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-14 14:30:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:30:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-08-14 14:30:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-08-14 14:30:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:30:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-08-14 14:30:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-08-14 14:30:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:30:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:30:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:30:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-08-14 14:30:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-08-14 14:30:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:30:22,319 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:30:22,321 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:30:22,481 INFO L1266 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(~#string_A~0.base, ~#string_A~0.offset);havoc ~#string_A~0.base, ~#string_A~0.offset;call ULTIMATE.dealloc(~#string_B~0.base, ~#string_B~0.offset);havoc ~#string_B~0.base, ~#string_B~0.offset; [2024-08-14 14:30:22,542 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-08-14 14:30:22,542 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:30:22,551 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:30:22,551 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:30:22,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:30:22 BoogieIcfgContainer [2024-08-14 14:30:22,552 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:30:22,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:30:22,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:30:22,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:30:22,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:30:20" (1/4) ... [2024-08-14 14:30:22,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0e3b3d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:30:22, skipping insertion in model container [2024-08-14 14:30:22,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:30:21" (2/4) ... [2024-08-14 14:30:22,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0e3b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:30:22, skipping insertion in model container [2024-08-14 14:30:22,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:22" (3/4) ... [2024-08-14 14:30:22,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0e3b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:30:22, skipping insertion in model container [2024-08-14 14:30:22,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:30:22" (4/4) ... [2024-08-14 14:30:22,561 INFO L119 eAbstractionObserver]: Analyzing ICFG string-2.i [2024-08-14 14:30:22,561 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:30:22,578 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:30:22,579 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:30:22,604 INFO L92 WitnessUtils]: Constructing product of automaton with 50 states and violation witness of the following lengths: [25] [2024-08-14 14:30:22,608 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 50 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:30:22,755 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 536 states to 67 states. [2024-08-14 14:30:22,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:30:22,789 INFO L357 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, mHoare=false, 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;@79dc736f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:30:22,789 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:30:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2024-08-14 14:30:22,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-08-14 14:30:22,798 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:22,799 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-14 14:30:22,800 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:22,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:22,807 INFO L85 PathProgramCache]: Analyzing trace with hash -140196610, now seen corresponding path program 1 times [2024-08-14 14:30:22,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:22,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57574844] [2024-08-14 14:30:22,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:22,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:23,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-08-14 14:30:23,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:23,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57574844] [2024-08-14 14:30:23,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57574844] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:30:23,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:30:23,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 14:30:23,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068400896] [2024-08-14 14:30:23,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:30:23,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-14 14:30:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:23,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-14 14:30:23,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-14 14:30:23,149 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:23,160 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2024-08-14 14:30:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 14:30:23,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2024-08-14 14:30:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:23,164 INFO L225 Difference]: With dead ends: 67 [2024-08-14 14:30:23,164 INFO L226 Difference]: Without dead ends: 67 [2024-08-14 14:30:23,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-08-14 14:30:23,169 INFO L413 NwaCegarLoop]: 48 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, 48 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-08-14 14:30:23,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:30:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-08-14 14:30:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2024-08-14 14:30:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-08-14 14:30:23,207 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 52 [2024-08-14 14:30:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:23,207 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-08-14 14:30:23,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2024-08-14 14:30:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-08-14 14:30:23,211 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:23,211 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-14 14:30:23,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:30:23,212 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:23,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:23,213 INFO L85 PathProgramCache]: Analyzing trace with hash -790603668, now seen corresponding path program 1 times [2024-08-14 14:30:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:23,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826271058] [2024-08-14 14:30:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:23,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:23,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-08-14 14:30:23,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:23,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826271058] [2024-08-14 14:30:23,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826271058] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:30:23,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:30:23,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:30:23,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161672571] [2024-08-14 14:30:23,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:30:23,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:30:23,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:23,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:30:23,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:30:23,491 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:23,532 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-08-14 14:30:23,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:30:23,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2024-08-14 14:30:23,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:23,534 INFO L225 Difference]: With dead ends: 66 [2024-08-14 14:30:23,535 INFO L226 Difference]: Without dead ends: 62 [2024-08-14 14:30:23,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:30:23,536 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:23,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:30:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-08-14 14:30:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2024-08-14 14:30:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-08-14 14:30:23,546 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 53 [2024-08-14 14:30:23,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:23,547 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-08-14 14:30:23,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-08-14 14:30:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-08-14 14:30:23,550 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:23,551 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-14 14:30:23,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 14:30:23,552 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:23,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:23,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1192290062, now seen corresponding path program 1 times [2024-08-14 14:30:23,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:23,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134664679] [2024-08-14 14:30:23,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:23,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:23,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-08-14 14:30:23,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:23,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134664679] [2024-08-14 14:30:23,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134664679] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:30:23,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:30:23,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:30:23,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35169588] [2024-08-14 14:30:23,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:30:23,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:30:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:23,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:30:23,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:30:23,774 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:23,793 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-08-14 14:30:23,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:30:23,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2024-08-14 14:30:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:23,794 INFO L225 Difference]: With dead ends: 77 [2024-08-14 14:30:23,795 INFO L226 Difference]: Without dead ends: 65 [2024-08-14 14:30:23,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:30:23,796 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:23,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:30:23,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-08-14 14:30:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-08-14 14:30:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 59 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2024-08-14 14:30:23,804 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 57 [2024-08-14 14:30:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:23,806 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2024-08-14 14:30:23,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-08-14 14:30:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-08-14 14:30:23,810 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:23,811 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-14 14:30:23,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-14 14:30:23,811 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:23,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1043741712, now seen corresponding path program 1 times [2024-08-14 14:30:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:23,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200883576] [2024-08-14 14:30:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:24,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-08-14 14:30:24,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:24,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200883576] [2024-08-14 14:30:24,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200883576] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:30:24,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838781285] [2024-08-14 14:30:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:24,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:24,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:30:24,076 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:30:24,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-08-14 14:30:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:24,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2024-08-14 14:30:24,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:30:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-08-14 14:30:24,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:30:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-08-14 14:30:24,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838781285] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:30:24,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:30:24,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2024-08-14 14:30:24,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120596913] [2024-08-14 14:30:24,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:30:24,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-14 14:30:24,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-14 14:30:24,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:30:24,375 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:24,683 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2024-08-14 14:30:24,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 14:30:24,684 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2024-08-14 14:30:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:24,686 INFO L225 Difference]: With dead ends: 121 [2024-08-14 14:30:24,686 INFO L226 Difference]: Without dead ends: 117 [2024-08-14 14:30:24,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-08-14 14:30:24,687 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 85 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:24,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 314 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:30:24,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-08-14 14:30:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2024-08-14 14:30:24,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 92 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2024-08-14 14:30:24,695 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 61 [2024-08-14 14:30:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:24,696 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2024-08-14 14:30:24,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2024-08-14 14:30:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-08-14 14:30:24,698 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:24,698 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-14 14:30:24,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-08-14 14:30:24,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:24,903 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:24,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:24,903 INFO L85 PathProgramCache]: Analyzing trace with hash 4759279, now seen corresponding path program 1 times [2024-08-14 14:30:24,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:24,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027846685] [2024-08-14 14:30:24,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:24,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:30:24,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:30:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:30:25,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:30:25,007 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:30:25,008 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:30:25,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-14 14:30:25,014 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-08-14 14:30:25,018 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:30:25,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:30:25 BoogieIcfgContainer [2024-08-14 14:30:25,070 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:30:25,070 INFO L158 Benchmark]: Toolchain (without parser) took 3255.41ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 81.6MB in the end (delta: 42.3MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-08-14 14:30:25,071 INFO L158 Benchmark]: Witness Parser took 0.38ms. Allocated memory is still 104.9MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:30:25,072 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:30:25,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.48ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 111.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-14 14:30:25,074 INFO L158 Benchmark]: Boogie Preprocessor took 76.41ms. Allocated memory is still 159.4MB. Free memory was 111.4MB in the beginning and 109.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:30:25,074 INFO L158 Benchmark]: IcfgBuilder took 405.46ms. Allocated memory is still 159.4MB. Free memory was 109.3MB in the beginning and 93.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-08-14 14:30:25,074 INFO L158 Benchmark]: TraceAbstraction took 2513.87ms. Allocated memory is still 159.4MB. Free memory was 92.5MB in the beginning and 81.6MB in the end (delta: 10.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-08-14 14:30:25,075 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.38ms. Allocated memory is still 104.9MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.48ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 111.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.41ms. Allocated memory is still 159.4MB. Free memory was 111.4MB in the beginning and 109.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 405.46ms. Allocated memory is still 159.4MB. Free memory was 109.3MB in the beginning and 93.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2513.87ms. Allocated memory is still 159.4MB. Free memory was 92.5MB in the beginning and 81.6MB in the end (delta: 10.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: 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 shiftLeft at line 69. Possible FailurePath: [L31] char string_A[5], string_B[5]; [L32] int i, j, nc_A, nc_B, found=0; [L35] i=0 VAL [i=0, string_A={7:0}, string_B={6:0}] [L35] COND TRUE i<5 VAL [i=0, string_A={7:0}, string_B={6:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [i=0, string_A={7:0}, string_B={6:0}] [L35] i++ VAL [i=1, string_A={7:0}, string_B={6:0}] [L35] COND TRUE i<5 VAL [i=1, string_A={7:0}, string_B={6:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [i=1, string_A={7:0}, string_B={6:0}] [L35] i++ VAL [i=2, string_A={7:0}, string_B={6:0}] [L35] COND TRUE i<5 VAL [i=2, string_A={7:0}, string_B={6:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [i=2, string_A={7:0}, string_B={6:0}] [L35] i++ VAL [i=3, string_A={7:0}, string_B={6:0}] [L35] COND TRUE i<5 VAL [i=3, string_A={7:0}, string_B={6:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [i=3, string_A={7:0}, string_B={6:0}] [L35] i++ VAL [i=4, string_A={7:0}, string_B={6:0}] [L35] COND TRUE i<5 VAL [i=4, string_A={7:0}, string_B={6:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [i=4, string_A={7:0}, string_B={6:0}] [L35] i++ VAL [i=5, string_A={7:0}, string_B={6:0}] [L35] COND FALSE !(i<5) VAL [string_A={7:0}, string_B={6:0}] [L37] EXPR string_A[5 -1] VAL [string_A={7:0}, string_B={6:0}] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 VAL [i=0, string_A={7:0}, string_B={6:0}] [L39] COND TRUE i<5 VAL [i=0, string_A={7:0}, string_B={6:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [i=0, string_A={7:0}, string_B={6:0}] [L39] i++ VAL [i=1, string_A={7:0}, string_B={6:0}] [L39] COND TRUE i<5 VAL [i=1, string_A={7:0}, string_B={6:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [i=1, string_A={7:0}, string_B={6:0}] [L39] i++ VAL [i=2, string_A={7:0}, string_B={6:0}] [L39] COND TRUE i<5 VAL [i=2, string_A={7:0}, string_B={6:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [i=2, string_A={7:0}, string_B={6:0}] [L39] i++ VAL [i=3, string_A={7:0}, string_B={6:0}] [L39] COND TRUE i<5 VAL [i=3, string_A={7:0}, string_B={6:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [i=3, string_A={7:0}, string_B={6:0}] [L39] i++ VAL [i=4, string_A={7:0}, string_B={6:0}] [L39] COND TRUE i<5 VAL [i=4, string_A={7:0}, string_B={6:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [i=4, string_A={7:0}, string_B={6:0}] [L39] i++ VAL [i=5, string_A={7:0}, string_B={6:0}] [L39] COND FALSE !(i<5) VAL [string_A={7:0}, string_B={6:0}] [L41] EXPR string_B[5 -1] VAL [string_A={7:0}, string_B={6:0}] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 VAL [nc_A=0, string_A={7:0}, string_B={6:0}] [L44] EXPR string_A[nc_A] VAL [nc_A=0, string_A={7:0}, string_B={6:0}] [L44] COND TRUE string_A[nc_A]!='\0' [L45] nc_A++ VAL [nc_A=1, string_A={7:0}, string_B={6:0}] [L44] EXPR string_A[nc_A] VAL [nc_A=1, string_A={7:0}, string_B={6:0}] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 VAL [nc_A=1, nc_B=0, string_A={7:0}, string_B={6:0}] [L48] EXPR string_B[nc_B] VAL [nc_A=1, nc_B=0, string_A={7:0}, string_B={6:0}] [L48] COND TRUE string_B[nc_B]!='\0' [L49] nc_B++ VAL [nc_A=1, nc_B=1, string_A={7:0}, string_B={6:0}] [L48] EXPR string_B[nc_B] VAL [nc_A=1, nc_B=1, string_A={7:0}, string_B={6:0}] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) VAL [nc_A=1, nc_B=1, string_A={7:0}, string_B={6:0}] [L54] EXPR j=0 [L54] i=j=0 VAL [i=0, j=0, nc_A=1, nc_B=1, string_A={7:0}, string_B={6:0}] [L55] COND TRUE (inc_B-1)<nc_B-1)<nc_B-1)< main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:30:27,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:30:27,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:30:27,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:30:27,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:30:27,833 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:30:27,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-2.i [2024-08-14 14:30:29,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:30:29,519 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:30:29,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i [2024-08-14 14:30:29,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18e87d318/b7a7afbc9cfd41bbbc0b57adad547c54/FLAG161664ec3 [2024-08-14 14:30:29,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18e87d318/b7a7afbc9cfd41bbbc0b57adad547c54 [2024-08-14 14:30:29,552 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:30:29,553 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:30:29,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/string-2.yml/witness.yml [2024-08-14 14:30:29,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:30:29,650 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:30:29,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:30:29,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:30:29,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:30:29,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:30:29" (1/2) ... [2024-08-14 14:30:29,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b9efb45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:29, skipping insertion in model container [2024-08-14 14:30:29,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:30:29" (1/2) ... [2024-08-14 14:30:29,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4531d9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:29, skipping insertion in model container [2024-08-14 14:30:29,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:30:29" (2/2) ... [2024-08-14 14:30:29,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b9efb45 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:29, skipping insertion in model container [2024-08-14 14:30:29,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:30:29" (2/2) ... [2024-08-14 14:30:29,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:30:29,842 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i[896,909] [2024-08-14 14:30:29,874 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:30:29,889 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:30:29,903 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i[896,909] [2024-08-14 14:30:29,923 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:30:29,943 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:30:29,944 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:29 WrapperNode [2024-08-14 14:30:29,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:30:29,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:30:29,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:30:29,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:30:29,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:29" (1/1) ... [2024-08-14 14:30:29,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:29" (1/1) ... [2024-08-14 14:30:29,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:29" (1/1) ... [2024-08-14 14:30:29,999 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-08-14 14:30:29,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:29" (1/1) ... [2024-08-14 14:30:30,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:29" (1/1) ... [2024-08-14 14:30:30,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:29" (1/1) ... [2024-08-14 14:30:30,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:29" (1/1) ... [2024-08-14 14:30:30,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:29" (1/1) ... [2024-08-14 14:30:30,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:30:30,026 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:30:30,026 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:30:30,026 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:30:30,027 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:29" (1/1) ... [2024-08-14 14:30:30,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:30:30,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:30:30,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:30:30,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:30:30,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:30:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:30:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:30:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:30:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:30:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:30:30,115 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:30:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:30:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2024-08-14 14:30:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2024-08-14 14:30:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:30:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:30:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:30:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:30:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2024-08-14 14:30:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:30:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-14 14:30:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-14 14:30:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-08-14 14:30:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-08-14 14:30:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-14 14:30:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-08-14 14:30:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-08-14 14:30:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:30:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:30:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-14 14:30:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-08-14 14:30:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-08-14 14:30:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:30:30,216 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:30:30,219 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:30:30,435 INFO L1266 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(~#string_A~0.base, ~#string_A~0.offset);havoc ~#string_A~0.base, ~#string_A~0.offset;call ULTIMATE.dealloc(~#string_B~0.base, ~#string_B~0.offset);havoc ~#string_B~0.base, ~#string_B~0.offset; [2024-08-14 14:30:30,486 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-08-14 14:30:30,486 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:30:30,497 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:30:30,497 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:30:30,497 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:30:30 BoogieIcfgContainer [2024-08-14 14:30:30,497 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:30:30,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:30:30,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:30:30,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:30:30,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:30:29" (1/4) ... [2024-08-14 14:30:30,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313ca609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:30:30, skipping insertion in model container [2024-08-14 14:30:30,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:30:29" (2/4) ... [2024-08-14 14:30:30,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313ca609 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:30:30, skipping insertion in model container [2024-08-14 14:30:30,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:29" (3/4) ... [2024-08-14 14:30:30,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313ca609 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:30:30, skipping insertion in model container [2024-08-14 14:30:30,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:30:30" (4/4) ... [2024-08-14 14:30:30,508 INFO L119 eAbstractionObserver]: Analyzing ICFG string-2.i [2024-08-14 14:30:30,508 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:30:30,528 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:30:30,528 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:30:30,563 INFO L92 WitnessUtils]: Constructing product of automaton with 49 states and violation witness of the following lengths: [25] [2024-08-14 14:30:30,567 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 49 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:30:30,701 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 521 states to 66 states. [2024-08-14 14:30:30,736 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:30:30,743 INFO L357 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, mHoare=false, 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;@14f1d6d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:30:30,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:30:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2024-08-14 14:30:30,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-08-14 14:30:30,751 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:30,752 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-14 14:30:30,753 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:30,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash 76219365, now seen corresponding path program 1 times [2024-08-14 14:30:30,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:30:30,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186583703] [2024-08-14 14:30:30,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:30,773 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-08-14 14:30:30,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:30:30,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-08-14 14:30:30,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-08-14 14:30:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:30,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 1 conjunts are in the unsatisfiable core [2024-08-14 14:30:30,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:30:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-08-14 14:30:30,928 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:30:30,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-14 14:30:30,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186583703] [2024-08-14 14:30:30,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186583703] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:30:30,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:30:30,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 14:30:30,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820836186] [2024-08-14 14:30:30,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:30:30,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-14 14:30:30,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-14 14:30:30,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-14 14:30:30,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-14 14:30:30,979 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:30,991 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-08-14 14:30:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 14:30:30,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2024-08-14 14:30:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:30,995 INFO L225 Difference]: With dead ends: 66 [2024-08-14 14:30:30,995 INFO L226 Difference]: Without dead ends: 66 [2024-08-14 14:30:30,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-08-14 14:30:31,000 INFO L413 NwaCegarLoop]: 46 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, 46 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-08-14 14:30:31,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:30:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-08-14 14:30:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2024-08-14 14:30:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-08-14 14:30:31,037 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 51 [2024-08-14 14:30:31,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:31,041 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-08-14 14:30:31,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:31,041 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-08-14 14:30:31,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-08-14 14:30:31,043 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:31,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-14 14:30:31,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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-08-14 14:30:31,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-08-14 14:30:31,244 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:31,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:31,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1564939769, now seen corresponding path program 1 times [2024-08-14 14:30:31,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:30:31,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847659579] [2024-08-14 14:30:31,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:31,250 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-08-14 14:30:31,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:30:31,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-08-14 14:30:31,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-08-14 14:30:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:31,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2024-08-14 14:30:31,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:30:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-08-14 14:30:31,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:30:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-08-14 14:30:31,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-14 14:30:31,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847659579] [2024-08-14 14:30:31,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847659579] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:30:31,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-14 14:30:31,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-08-14 14:30:31,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625915374] [2024-08-14 14:30:31,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-14 14:30:31,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 14:30:31,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-14 14:30:31,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 14:30:31,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:30:31,548 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:31,852 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2024-08-14 14:30:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:30:31,853 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2024-08-14 14:30:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:31,855 INFO L225 Difference]: With dead ends: 105 [2024-08-14 14:30:31,855 INFO L226 Difference]: Without dead ends: 105 [2024-08-14 14:30:31,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-08-14 14:30:31,857 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 88 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:31,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 173 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:30:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-08-14 14:30:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 81. [2024-08-14 14:30:31,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2024-08-14 14:30:31,868 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 52 [2024-08-14 14:30:31,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:31,868 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2024-08-14 14:30:31,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2024-08-14 14:30:31,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-08-14 14:30:31,873 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:31,873 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-14 14:30:31,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-08-14 14:30:32,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-08-14 14:30:32,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:32,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1342997657, now seen corresponding path program 2 times [2024-08-14 14:30:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:30:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870925516] [2024-08-14 14:30:32,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 14:30:32,079 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-08-14 14:30:32,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:30:32,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-08-14 14:30:32,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-08-14 14:30:32,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 14:30:32,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:30:32,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2024-08-14 14:30:32,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:30:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-08-14 14:30:32,264 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:30:32,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-14 14:30:32,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870925516] [2024-08-14 14:30:32,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870925516] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:30:32,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:30:32,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:30:32,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213716765] [2024-08-14 14:30:32,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:30:32,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:30:32,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-14 14:30:32,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:30:32,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:30:32,266 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:32,297 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2024-08-14 14:30:32,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:30:32,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2024-08-14 14:30:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:32,300 INFO L225 Difference]: With dead ends: 94 [2024-08-14 14:30:32,300 INFO L226 Difference]: Without dead ends: 85 [2024-08-14 14:30:32,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:30:32,301 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:32,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 91 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:30:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-08-14 14:30:32,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-08-14 14:30:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 79 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-08-14 14:30:32,313 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 76 [2024-08-14 14:30:32,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:32,313 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-08-14 14:30:32,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-08-14 14:30:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-08-14 14:30:32,315 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:32,315 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-14 14:30:32,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-08-14 14:30:32,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-08-14 14:30:32,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:32,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:32,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1752670711, now seen corresponding path program 1 times [2024-08-14 14:30:32,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:30:32,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491413732] [2024-08-14 14:30:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:32,518 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-08-14 14:30:32,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:30:32,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-08-14 14:30:32,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-08-14 14:30:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:32,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2024-08-14 14:30:32,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:30:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-08-14 14:30:32,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:30:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-08-14 14:30:32,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-14 14:30:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491413732] [2024-08-14 14:30:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491413732] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:30:32,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-14 14:30:32,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-08-14 14:30:32,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154612035] [2024-08-14 14:30:32,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-14 14:30:32,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 14:30:32,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-14 14:30:32,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 14:30:32,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:30:32,809 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:32,952 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2024-08-14 14:30:32,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 14:30:32,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2024-08-14 14:30:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:32,955 INFO L225 Difference]: With dead ends: 157 [2024-08-14 14:30:32,956 INFO L226 Difference]: Without dead ends: 154 [2024-08-14 14:30:32,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-08-14 14:30:32,958 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 104 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:32,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 186 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:30:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-08-14 14:30:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 100. [2024-08-14 14:30:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.105263157894737) internal successors, (105), 95 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-08-14 14:30:32,970 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 80 [2024-08-14 14:30:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:32,971 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-08-14 14:30:32,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:30:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-08-14 14:30:32,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-08-14 14:30:32,972 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:32,972 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-14 14:30:32,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-08-14 14:30:33,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-08-14 14:30:33,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:33,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:33,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1837488021, now seen corresponding path program 1 times [2024-08-14 14:30:33,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:30:33,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580246417] [2024-08-14 14:30:33,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:33,175 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-08-14 14:30:33,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:30:33,178 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-08-14 14:30:33,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-08-14 14:30:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:30:33,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:30:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:30:33,434 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-14 14:30:33,434 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:30:33,435 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:30:33,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-08-14 14:30:33,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-08-14 14:30:33,640 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-08-14 14:30:33,644 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:30:33,686 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:30:33 BoogieIcfgContainer [2024-08-14 14:30:33,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:30:33,687 INFO L158 Benchmark]: Toolchain (without parser) took 4037.65ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 51.8MB in the beginning and 52.2MB in the end (delta: -399.5kB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-08-14 14:30:33,688 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 54.5MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:30:33,688 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 75.5MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:30:33,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.77ms. Allocated memory is still 75.5MB. Free memory was 51.8MB in the beginning and 39.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-14 14:30:33,689 INFO L158 Benchmark]: Boogie Preprocessor took 79.02ms. Allocated memory is still 75.5MB. Free memory was 39.1MB in the beginning and 36.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-14 14:30:33,689 INFO L158 Benchmark]: IcfgBuilder took 471.85ms. Allocated memory is still 75.5MB. Free memory was 36.4MB in the beginning and 47.7MB in the end (delta: -11.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-08-14 14:30:33,689 INFO L158 Benchmark]: TraceAbstraction took 3187.41ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 47.3MB in the beginning and 52.2MB in the end (delta: -4.9MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-08-14 14:30:33,691 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.10ms. Allocated memory is still 54.5MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.18ms. Allocated memory is still 75.5MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.77ms. Allocated memory is still 75.5MB. Free memory was 51.8MB in the beginning and 39.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.02ms. Allocated memory is still 75.5MB. Free memory was 39.1MB in the beginning and 36.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 471.85ms. Allocated memory is still 75.5MB. Free memory was 36.4MB in the beginning and 47.7MB in the end (delta: -11.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3187.41ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 47.3MB in the beginning and 52.2MB in the end (delta: -4.9MB). Peak memory consumption was 12.1MB. 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 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L31] char string_A[5], string_B[5]; [L32] int i, j, nc_A, nc_B, found=0; [L35] i=0 VAL [i=0, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 VAL [i=0, string_A={7:0}, string_B={3:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [i=0, string_A={7:0}, string_B={3:0}] [L35] i++ VAL [i=1, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 VAL [i=1, string_A={7:0}, string_B={3:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [i=1, string_A={7:0}, string_B={3:0}] [L35] i++ VAL [i=2, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 VAL [i=2, string_A={7:0}, string_B={3:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [i=2, string_A={7:0}, string_B={3:0}] [L35] i++ VAL [i=3, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 VAL [i=3, string_A={7:0}, string_B={3:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [i=3, string_A={7:0}, string_B={3:0}] [L35] i++ VAL [i=4, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 VAL [i=4, string_A={7:0}, string_B={3:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [i=4, string_A={7:0}, string_B={3:0}] [L35] i++ VAL [i=5, string_A={7:0}, string_B={3:0}] [L35] COND FALSE !(i<5) VAL [string_A={7:0}, string_B={3:0}] [L37] EXPR string_A[5 -1] VAL [string_A={7:0}, string_B={3:0}] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 VAL [i=0, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 VAL [i=0, string_A={7:0}, string_B={3:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [i=0, string_A={7:0}, string_B={3:0}] [L39] i++ VAL [i=1, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 VAL [i=1, string_A={7:0}, string_B={3:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [i=1, string_A={7:0}, string_B={3:0}] [L39] i++ VAL [i=2, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 VAL [i=2, string_A={7:0}, string_B={3:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [i=2, string_A={7:0}, string_B={3:0}] [L39] i++ VAL [i=3, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 VAL [i=3, string_A={7:0}, string_B={3:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [i=3, string_A={7:0}, string_B={3:0}] [L39] i++ VAL [i=4, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 VAL [i=4, string_A={7:0}, string_B={3:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [i=4, string_A={7:0}, string_B={3:0}] [L39] i++ VAL [i=5, string_A={7:0}, string_B={3:0}] [L39] COND FALSE !(i<5) VAL [string_A={7:0}, string_B={3:0}] [L41] EXPR string_B[5 -1] VAL [string_A={7:0}, string_B={3:0}] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 VAL [nc_A=0, string_A={7:0}, string_B={3:0}] [L44] EXPR string_A[nc_A] VAL [nc_A=0, string_A={7:0}, string_B={3:0}] [L44] COND TRUE string_A[nc_A]!='\0' [L45] nc_A++ VAL [nc_A=1, string_A={7:0}, string_B={3:0}] [L44] EXPR string_A[nc_A] VAL [nc_A=1, string_A={7:0}, string_B={3:0}] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 VAL [nc_A=1, nc_B=0, string_A={7:0}, string_B={3:0}] [L48] EXPR string_B[nc_B] VAL [nc_A=1, nc_B=0, string_A={7:0}, string_B={3:0}] [L48] COND TRUE string_B[nc_B]!='\0' [L49] nc_B++ VAL [nc_A=1, nc_B=1, string_A={7:0}, string_B={3:0}] [L48] EXPR string_B[nc_B] VAL [nc_A=1, nc_B=1, string_A={7:0}, string_B={3:0}] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) VAL [nc_A=1, nc_B=1, string_A={7:0}, string_B={3:0}] [L54] EXPR j=0 [L54] i=j=0 VAL [i=0, j=0, nc_A=1, nc_B=1, string_A={7:0}, string_B={3:0}] [L55] COND TRUE (inc_B-1)<