./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3a877d22 Calling Ultimate with: /usr/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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-buckets-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:04:43,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:04:43,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:04:43,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:04:43,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:04:43,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:04:43,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:04:43,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:04:43,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:04:43,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:04:43,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:04:43,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:04:43,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:04:43,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:04:43,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:04:43,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:04:43,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:04:43,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:04:43,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:04:43,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:04:43,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:04:43,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:04:43,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:04:43,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:04:43,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:04:43,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:04:43,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:04:43,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:04:43,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:04:43,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:04:43,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:04:43,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:04:43,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:04:43,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:04:43,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:04:43,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:04:43,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:04:43,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:04:43,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:04:43,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:04:43,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:04:43,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-15 14:04:43,662 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:04:43,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:04:43,665 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:04:43,665 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:04:43,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:04:43,666 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:04:43,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:04:43,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:04:43,667 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:04:43,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:04:43,667 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 14:04:43,667 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:04:43,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:04:43,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 14:04:43,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:04:43,668 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:04:43,668 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:04:43,668 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:04:43,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:04:43,668 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:04:43,668 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 14:04:43,669 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:04:43,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:04:43,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:04:43,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:04:43,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:43,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:04:43,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:04:43,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 14:04:43,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 14:04:43,671 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:04:43,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2021-12-15 14:04:43,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:04:43,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:04:43,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:04:43,889 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:04:43,889 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:04:43,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2021-12-15 14:04:43,930 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb14f588d/c94f73d639264578ac71de5495efdbd7/FLAGde684d991 [2021-12-15 14:04:44,345 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:04:44,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2021-12-15 14:04:44,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb14f588d/c94f73d639264578ac71de5495efdbd7/FLAGde684d991 [2021-12-15 14:04:44,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb14f588d/c94f73d639264578ac71de5495efdbd7 [2021-12-15 14:04:44,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:04:44,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:04:44,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:44,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:04:44,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:04:44,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:44" (1/1) ... [2021-12-15 14:04:44,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c82a447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:44, skipping insertion in model container [2021-12-15 14:04:44,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:44" (1/1) ... [2021-12-15 14:04:44,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:04:44,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:04:44,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2021-12-15 14:04:44,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2021-12-15 14:04:44,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2021-12-15 14:04:44,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2021-12-15 14:04:44,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2021-12-15 14:04:44,687 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:44,694 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:04:44,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2021-12-15 14:04:44,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2021-12-15 14:04:44,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2021-12-15 14:04:44,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2021-12-15 14:04:44,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2021-12-15 14:04:44,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:44,752 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:04:44,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:44 WrapperNode [2021-12-15 14:04:44,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:44,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:44,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:04:44,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:04:44,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:44" (1/1) ... [2021-12-15 14:04:44,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:44" (1/1) ... [2021-12-15 14:04:44,806 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 161 [2021-12-15 14:04:44,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:44,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:04:44,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:04:44,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:04:44,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:44" (1/1) ... [2021-12-15 14:04:44,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:44" (1/1) ... [2021-12-15 14:04:44,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:44" (1/1) ... [2021-12-15 14:04:44,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:44" (1/1) ... [2021-12-15 14:04:44,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:44" (1/1) ... [2021-12-15 14:04:44,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:44" (1/1) ... [2021-12-15 14:04:44,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:44" (1/1) ... [2021-12-15 14:04:44,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:04:44,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:04:44,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:04:44,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:04:44,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:44" (1/1) ... [2021-12-15 14:04:44,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:44,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:44,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 14:04:44,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 14:04:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 14:04:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 14:04:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 14:04:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 14:04:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 14:04:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 14:04:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:04:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 14:04:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:04:44,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:04:45,015 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:04:45,016 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:04:45,357 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:04:45,362 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:04:45,369 INFO L301 CfgBuilder]: Removed 15 assume(true) statements. [2021-12-15 14:04:45,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:45 BoogieIcfgContainer [2021-12-15 14:04:45,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:04:45,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:04:45,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:04:45,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:04:45,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:04:44" (1/3) ... [2021-12-15 14:04:45,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb2f78b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:45, skipping insertion in model container [2021-12-15 14:04:45,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:44" (2/3) ... [2021-12-15 14:04:45,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb2f78b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:45, skipping insertion in model container [2021-12-15 14:04:45,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:45" (3/3) ... [2021-12-15 14:04:45,419 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2021-12-15 14:04:45,423 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:04:45,423 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2021-12-15 14:04:45,475 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:04:45,480 INFO L339 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 14:04:45,480 INFO L340 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2021-12-15 14:04:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:45,496 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:45,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:45,497 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:45,504 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 14:04:45,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:45,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891372346] [2021-12-15 14:04:45,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:45,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:45,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:45,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891372346] [2021-12-15 14:04:45,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891372346] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:45,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:45,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:45,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649722004] [2021-12-15 14:04:45,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:45,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:45,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:45,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:45,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:45,666 INFO L87 Difference]: Start difference. First operand has 155 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:45,835 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2021-12-15 14:04:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:45,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-15 14:04:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:45,851 INFO L225 Difference]: With dead ends: 190 [2021-12-15 14:04:45,851 INFO L226 Difference]: Without dead ends: 186 [2021-12-15 14:04:45,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:45,856 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 141 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:45,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 120 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-12-15 14:04:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 149. [2021-12-15 14:04:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 81 states have (on average 1.9259259259259258) internal successors, (156), 148 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2021-12-15 14:04:45,899 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 3 [2021-12-15 14:04:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:45,900 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2021-12-15 14:04:45,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2021-12-15 14:04:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:45,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:45,907 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:45,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 14:04:45,907 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:45,908 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 14:04:45,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:45,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103852429] [2021-12-15 14:04:45,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:45,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:45,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:45,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103852429] [2021-12-15 14:04:45,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103852429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:45,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:45,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:45,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869473299] [2021-12-15 14:04:45,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:45,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:45,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:45,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:45,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:45,941 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:46,021 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2021-12-15 14:04:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:46,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-15 14:04:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:46,023 INFO L225 Difference]: With dead ends: 185 [2021-12-15 14:04:46,023 INFO L226 Difference]: Without dead ends: 185 [2021-12-15 14:04:46,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:46,024 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:46,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 190 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-15 14:04:46,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2021-12-15 14:04:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 81 states have (on average 1.876543209876543) internal successors, (152), 144 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2021-12-15 14:04:46,030 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 3 [2021-12-15 14:04:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:46,030 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2021-12-15 14:04:46,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2021-12-15 14:04:46,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 14:04:46,031 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:46,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:46,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 14:04:46,032 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:46,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:46,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924362, now seen corresponding path program 1 times [2021-12-15 14:04:46,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:46,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040823705] [2021-12-15 14:04:46,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:46,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:46,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:46,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040823705] [2021-12-15 14:04:46,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040823705] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:46,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:46,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:46,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881174125] [2021-12-15 14:04:46,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:46,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:46,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:46,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:46,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:46,092 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:46,286 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2021-12-15 14:04:46,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:04:46,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 14:04:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:46,287 INFO L225 Difference]: With dead ends: 151 [2021-12-15 14:04:46,287 INFO L226 Difference]: Without dead ends: 151 [2021-12-15 14:04:46,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:04:46,288 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 97 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:46,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 305 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-15 14:04:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2021-12-15 14:04:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 142 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:46,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 158 transitions. [2021-12-15 14:04:46,293 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 158 transitions. Word has length 10 [2021-12-15 14:04:46,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:46,293 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 158 transitions. [2021-12-15 14:04:46,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 158 transitions. [2021-12-15 14:04:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 14:04:46,293 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:46,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:46,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 14:04:46,294 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924363, now seen corresponding path program 1 times [2021-12-15 14:04:46,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:46,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455834604] [2021-12-15 14:04:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:46,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:46,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:46,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455834604] [2021-12-15 14:04:46,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455834604] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:46,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:46,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:46,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079147026] [2021-12-15 14:04:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:46,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:46,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:46,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:46,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:46,364 INFO L87 Difference]: Start difference. First operand 143 states and 158 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:46,550 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2021-12-15 14:04:46,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:04:46,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 14:04:46,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:46,551 INFO L225 Difference]: With dead ends: 139 [2021-12-15 14:04:46,551 INFO L226 Difference]: Without dead ends: 139 [2021-12-15 14:04:46,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:04:46,555 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 6 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:46,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 416 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:46,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-15 14:04:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-12-15 14:04:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.711111111111111) internal successors, (154), 138 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2021-12-15 14:04:46,565 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 10 [2021-12-15 14:04:46,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:46,565 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2021-12-15 14:04:46,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2021-12-15 14:04:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 14:04:46,566 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:46,566 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:46,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 14:04:46,567 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:46,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:46,568 INFO L85 PathProgramCache]: Analyzing trace with hash 592229104, now seen corresponding path program 1 times [2021-12-15 14:04:46,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:46,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493869731] [2021-12-15 14:04:46,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:46,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:46,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:46,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493869731] [2021-12-15 14:04:46,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493869731] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:46,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:46,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:46,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474622183] [2021-12-15 14:04:46,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:46,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:46,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:46,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:46,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:46,649 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:46,811 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2021-12-15 14:04:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:46,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 14:04:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:46,812 INFO L225 Difference]: With dead ends: 146 [2021-12-15 14:04:46,812 INFO L226 Difference]: Without dead ends: 146 [2021-12-15 14:04:46,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:46,813 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 94 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:46,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 297 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:46,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-15 14:04:46,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2021-12-15 14:04:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 90 states have (on average 1.7) internal successors, (153), 137 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2021-12-15 14:04:46,817 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 17 [2021-12-15 14:04:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:46,817 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2021-12-15 14:04:46,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2021-12-15 14:04:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 14:04:46,818 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:46,818 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:46,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 14:04:46,818 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:46,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash 592229105, now seen corresponding path program 1 times [2021-12-15 14:04:46,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:46,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316003529] [2021-12-15 14:04:46,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:46,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:46,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:46,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316003529] [2021-12-15 14:04:46,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316003529] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:46,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:46,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:46,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313161530] [2021-12-15 14:04:46,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:46,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:46,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:46,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:46,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:46,894 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:47,041 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2021-12-15 14:04:47,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:47,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 14:04:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:47,042 INFO L225 Difference]: With dead ends: 138 [2021-12-15 14:04:47,042 INFO L226 Difference]: Without dead ends: 138 [2021-12-15 14:04:47,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:47,042 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 8 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:47,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 403 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:47,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-15 14:04:47,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2021-12-15 14:04:47,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 90 states have (on average 1.6666666666666667) internal successors, (150), 134 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2021-12-15 14:04:47,045 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 17 [2021-12-15 14:04:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:47,046 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2021-12-15 14:04:47,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2021-12-15 14:04:47,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:04:47,046 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:47,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:47,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 14:04:47,046 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:47,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:47,047 INFO L85 PathProgramCache]: Analyzing trace with hash 840457529, now seen corresponding path program 1 times [2021-12-15 14:04:47,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:47,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104754903] [2021-12-15 14:04:47,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:47,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:47,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:47,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104754903] [2021-12-15 14:04:47,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104754903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:47,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:47,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:47,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601184470] [2021-12-15 14:04:47,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:47,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:47,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:47,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:47,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:47,084 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:47,133 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2021-12-15 14:04:47,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:47,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:04:47,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:47,134 INFO L225 Difference]: With dead ends: 141 [2021-12-15 14:04:47,134 INFO L226 Difference]: Without dead ends: 141 [2021-12-15 14:04:47,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:47,135 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 67 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:47,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 143 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:47,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-15 14:04:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2021-12-15 14:04:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 90 states have (on average 1.6111111111111112) internal successors, (145), 129 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2021-12-15 14:04:47,137 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 23 [2021-12-15 14:04:47,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:47,138 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2021-12-15 14:04:47,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2021-12-15 14:04:47,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:04:47,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:47,138 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:47,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 14:04:47,138 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:47,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:47,139 INFO L85 PathProgramCache]: Analyzing trace with hash 840457530, now seen corresponding path program 1 times [2021-12-15 14:04:47,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:47,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749751556] [2021-12-15 14:04:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:47,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:47,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:47,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749751556] [2021-12-15 14:04:47,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749751556] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:47,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:47,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:47,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302392644] [2021-12-15 14:04:47,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:47,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:47,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:47,175 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:47,237 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2021-12-15 14:04:47,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:47,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:04:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:47,238 INFO L225 Difference]: With dead ends: 136 [2021-12-15 14:04:47,238 INFO L226 Difference]: Without dead ends: 136 [2021-12-15 14:04:47,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:47,239 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 62 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:47,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 144 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-15 14:04:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2021-12-15 14:04:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 124 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2021-12-15 14:04:47,241 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 23 [2021-12-15 14:04:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:47,242 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2021-12-15 14:04:47,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2021-12-15 14:04:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 14:04:47,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:47,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:47,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 14:04:47,242 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:47,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash 225913191, now seen corresponding path program 1 times [2021-12-15 14:04:47,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:47,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585720475] [2021-12-15 14:04:47,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:47,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:47,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:47,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585720475] [2021-12-15 14:04:47,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585720475] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:47,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:47,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:47,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7363393] [2021-12-15 14:04:47,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:47,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:47,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:47,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:47,294 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:47,406 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2021-12-15 14:04:47,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:04:47,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-15 14:04:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:47,408 INFO L225 Difference]: With dead ends: 175 [2021-12-15 14:04:47,408 INFO L226 Difference]: Without dead ends: 175 [2021-12-15 14:04:47,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:47,409 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 214 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:47,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 109 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-15 14:04:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2021-12-15 14:04:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.5670103092783505) internal successors, (152), 131 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2021-12-15 14:04:47,412 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 25 [2021-12-15 14:04:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:47,412 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2021-12-15 14:04:47,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2021-12-15 14:04:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 14:04:47,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:47,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:47,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 14:04:47,413 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:47,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash 225913192, now seen corresponding path program 1 times [2021-12-15 14:04:47,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:47,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833826437] [2021-12-15 14:04:47,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:47,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:47,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:47,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833826437] [2021-12-15 14:04:47,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833826437] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:47,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:47,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:47,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494393334] [2021-12-15 14:04:47,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:47,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:47,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:47,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:47,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:47,505 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:47,611 INFO L93 Difference]: Finished difference Result 188 states and 217 transitions. [2021-12-15 14:04:47,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:04:47,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-15 14:04:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:47,613 INFO L225 Difference]: With dead ends: 188 [2021-12-15 14:04:47,613 INFO L226 Difference]: Without dead ends: 188 [2021-12-15 14:04:47,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:47,614 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 73 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:47,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 202 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-15 14:04:47,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 166. [2021-12-15 14:04:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 165 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 206 transitions. [2021-12-15 14:04:47,618 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 206 transitions. Word has length 25 [2021-12-15 14:04:47,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:47,618 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 206 transitions. [2021-12-15 14:04:47,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,618 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 206 transitions. [2021-12-15 14:04:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 14:04:47,619 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:47,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:47,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 14:04:47,619 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1586624732, now seen corresponding path program 1 times [2021-12-15 14:04:47,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:47,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144537059] [2021-12-15 14:04:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:47,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:47,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:47,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144537059] [2021-12-15 14:04:47,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144537059] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:47,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:47,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:47,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241145021] [2021-12-15 14:04:47,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:47,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:47,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:47,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:47,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:47,652 INFO L87 Difference]: Start difference. First operand 166 states and 206 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:47,714 INFO L93 Difference]: Finished difference Result 254 states and 308 transitions. [2021-12-15 14:04:47,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:04:47,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 14:04:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:47,715 INFO L225 Difference]: With dead ends: 254 [2021-12-15 14:04:47,715 INFO L226 Difference]: Without dead ends: 254 [2021-12-15 14:04:47,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:47,716 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 207 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:47,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 214 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-15 14:04:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 167. [2021-12-15 14:04:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 133 states have (on average 1.5488721804511278) internal successors, (206), 166 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 206 transitions. [2021-12-15 14:04:47,719 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 206 transitions. Word has length 26 [2021-12-15 14:04:47,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:47,719 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 206 transitions. [2021-12-15 14:04:47,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:47,719 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 206 transitions. [2021-12-15 14:04:47,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 14:04:47,720 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:47,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:47,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 14:04:47,720 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:47,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1044883735, now seen corresponding path program 1 times [2021-12-15 14:04:47,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:47,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396217660] [2021-12-15 14:04:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:47,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:47,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:47,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396217660] [2021-12-15 14:04:47,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396217660] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:47,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:47,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-15 14:04:47,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498017367] [2021-12-15 14:04:47,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:47,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-15 14:04:47,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:47,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-15 14:04:47,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-12-15 14:04:47,979 INFO L87 Difference]: Start difference. First operand 167 states and 206 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:48,601 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2021-12-15 14:04:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-15 14:04:48,602 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 14:04:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:48,602 INFO L225 Difference]: With dead ends: 179 [2021-12-15 14:04:48,602 INFO L226 Difference]: Without dead ends: 179 [2021-12-15 14:04:48,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2021-12-15 14:04:48,603 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 208 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:48,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 710 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:04:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-15 14:04:48,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 145. [2021-12-15 14:04:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 144 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2021-12-15 14:04:48,606 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 29 [2021-12-15 14:04:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:48,606 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2021-12-15 14:04:48,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2021-12-15 14:04:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 14:04:48,606 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:48,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:48,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 14:04:48,607 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:48,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash 981328753, now seen corresponding path program 1 times [2021-12-15 14:04:48,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:48,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560381600] [2021-12-15 14:04:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:48,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:48,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:48,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560381600] [2021-12-15 14:04:48,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560381600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:48,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:48,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:48,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753471989] [2021-12-15 14:04:48,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:48,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:48,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:48,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:48,636 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:48,650 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2021-12-15 14:04:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:48,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-15 14:04:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:48,651 INFO L225 Difference]: With dead ends: 145 [2021-12-15 14:04:48,651 INFO L226 Difference]: Without dead ends: 145 [2021-12-15 14:04:48,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:48,651 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:48,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 175 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-15 14:04:48,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2021-12-15 14:04:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 111 states have (on average 1.4684684684684686) internal successors, (163), 142 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2021-12-15 14:04:48,654 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 31 [2021-12-15 14:04:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:48,654 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2021-12-15 14:04:48,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2021-12-15 14:04:48,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 14:04:48,655 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:48,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:48,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 14:04:48,655 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:48,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:48,656 INFO L85 PathProgramCache]: Analyzing trace with hash 356424450, now seen corresponding path program 1 times [2021-12-15 14:04:48,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:48,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141931826] [2021-12-15 14:04:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:48,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:48,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:48,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141931826] [2021-12-15 14:04:48,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141931826] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:48,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:48,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 14:04:48,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105413405] [2021-12-15 14:04:48,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:48,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:04:48,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:48,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:04:48,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:48,747 INFO L87 Difference]: Start difference. First operand 143 states and 163 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:48,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:48,950 INFO L93 Difference]: Finished difference Result 225 states and 249 transitions. [2021-12-15 14:04:48,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:04:48,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-15 14:04:48,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:48,952 INFO L225 Difference]: With dead ends: 225 [2021-12-15 14:04:48,952 INFO L226 Difference]: Without dead ends: 225 [2021-12-15 14:04:48,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-15 14:04:48,952 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 404 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:48,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 219 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-15 14:04:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 172. [2021-12-15 14:04:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 171 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2021-12-15 14:04:48,955 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 32 [2021-12-15 14:04:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:48,955 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2021-12-15 14:04:48,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2021-12-15 14:04:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-15 14:04:48,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:48,956 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:48,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 14:04:48,956 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:48,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash 873646240, now seen corresponding path program 1 times [2021-12-15 14:04:48,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:48,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347276249] [2021-12-15 14:04:48,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:48,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:49,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:49,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347276249] [2021-12-15 14:04:49,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347276249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:49,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:49,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:49,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671726702] [2021-12-15 14:04:49,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:49,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:49,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:49,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:49,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:49,012 INFO L87 Difference]: Start difference. First operand 172 states and 207 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:49,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:49,093 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2021-12-15 14:04:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:04:49,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-15 14:04:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:49,094 INFO L225 Difference]: With dead ends: 209 [2021-12-15 14:04:49,094 INFO L226 Difference]: Without dead ends: 209 [2021-12-15 14:04:49,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:49,097 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 169 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:49,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 216 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-15 14:04:49,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2021-12-15 14:04:49,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 142 states have (on average 1.471830985915493) internal successors, (209), 173 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2021-12-15 14:04:49,101 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 35 [2021-12-15 14:04:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:49,101 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2021-12-15 14:04:49,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2021-12-15 14:04:49,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 14:04:49,103 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:49,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:49,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 14:04:49,103 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:49,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash 124937643, now seen corresponding path program 1 times [2021-12-15 14:04:49,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:49,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082394246] [2021-12-15 14:04:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:49,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:49,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:49,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082394246] [2021-12-15 14:04:49,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082394246] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:49,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491586177] [2021-12-15 14:04:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:49,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:49,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:49,448 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) [2021-12-15 14:04:49,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 14:04:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:49,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-15 14:04:49,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:49,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:49,744 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:04:49,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 14:04:49,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:49,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 14:04:49,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 14:04:49,861 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:04:49,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 14:04:49,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-15 14:04:50,068 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-15 14:04:50,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-12-15 14:04:50,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-12-15 14:04:50,155 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-15 14:04:50,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2021-12-15 14:04:50,165 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-15 14:04:50,165 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-15 14:04:50,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2021-12-15 14:04:50,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322492206] [2021-12-15 14:04:50,165 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:50,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-15 14:04:50,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:50,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-15 14:04:50,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2021-12-15 14:04:50,166 INFO L87 Difference]: Start difference. First operand 174 states and 209 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 14:04:50,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2021-12-15 14:04:50,167 INFO L933 BasicCegarLoop]: 1 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, 1 SdHoareTripleChecker+Invalid, 1 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 [2021-12-15 14:04:50,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:50,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:50,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-15 14:04:50,384 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@5242d107 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 14:04:50,386 INFO L158 Benchmark]: Toolchain (without parser) took 6021.16ms. Allocated memory was 117.4MB in the beginning and 205.5MB in the end (delta: 88.1MB). Free memory was 87.6MB in the beginning and 160.0MB in the end (delta: -72.4MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2021-12-15 14:04:50,387 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 14:04:50,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.62ms. Allocated memory is still 117.4MB. Free memory was 87.3MB in the beginning and 83.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 14:04:50,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.88ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 81.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 14:04:50,388 INFO L158 Benchmark]: Boogie Preprocessor took 49.01ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 79.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 14:04:50,388 INFO L158 Benchmark]: RCFGBuilder took 542.57ms. Allocated memory was 117.4MB in the beginning and 163.6MB in the end (delta: 46.1MB). Free memory was 79.7MB in the beginning and 138.5MB in the end (delta: -58.9MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2021-12-15 14:04:50,388 INFO L158 Benchmark]: TraceAbstraction took 4985.18ms. Allocated memory was 163.6MB in the beginning and 205.5MB in the end (delta: 41.9MB). Free memory was 138.0MB in the beginning and 160.0MB in the end (delta: -22.0MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2021-12-15 14:04:50,389 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.62ms. Allocated memory is still 117.4MB. Free memory was 87.3MB in the beginning and 83.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.88ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 81.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.01ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 79.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 542.57ms. Allocated memory was 117.4MB in the beginning and 163.6MB in the end (delta: 46.1MB). Free memory was 79.7MB in the beginning and 138.5MB in the end (delta: -58.9MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4985.18ms. Allocated memory was 163.6MB in the beginning and 205.5MB in the end (delta: 41.9MB). Free memory was 138.0MB in the beginning and 160.0MB in the end (delta: -22.0MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@5242d107 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@5242d107: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 14:04:50,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-buckets-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:04:52,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:04:52,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:04:52,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:04:52,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:04:52,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:04:52,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:04:52,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:04:52,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:04:52,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:04:52,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:04:52,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:04:52,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:04:52,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:04:52,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:04:52,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:04:52,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:04:52,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:04:52,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:04:52,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:04:52,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:04:52,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:04:52,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:04:52,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:04:52,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:04:52,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:04:52,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:04:52,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:04:52,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:04:52,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:04:52,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:04:52,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:04:52,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:04:52,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:04:52,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:04:52,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:04:52,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:04:52,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:04:52,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:04:52,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:04:52,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:04:52,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-15 14:04:52,159 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:04:52,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:04:52,160 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:04:52,160 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:04:52,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:04:52,161 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:04:52,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:04:52,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:04:52,163 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:04:52,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:04:52,163 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 14:04:52,163 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:04:52,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:04:52,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 14:04:52,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:04:52,164 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:04:52,164 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:04:52,164 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:04:52,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:04:52,165 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:04:52,165 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-15 14:04:52,165 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-15 14:04:52,165 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 14:04:52,165 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:04:52,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:04:52,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:04:52,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:04:52,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:52,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:04:52,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:04:52,174 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-15 14:04:52,174 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-15 14:04:52,174 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:04:52,175 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-15 14:04:52,175 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2021-12-15 14:04:52,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:04:52,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:04:52,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:04:52,470 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:04:52,470 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:04:52,471 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2021-12-15 14:04:52,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659c2b735/30bef6a290b14fa281cf020e8dd37556/FLAGc1761ed22 [2021-12-15 14:04:52,953 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:04:52,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2021-12-15 14:04:52,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659c2b735/30bef6a290b14fa281cf020e8dd37556/FLAGc1761ed22 [2021-12-15 14:04:53,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659c2b735/30bef6a290b14fa281cf020e8dd37556 [2021-12-15 14:04:53,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:04:53,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:04:53,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:53,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:04:53,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:04:53,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa31e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53, skipping insertion in model container [2021-12-15 14:04:53,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:04:53,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:04:53,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2021-12-15 14:04:53,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2021-12-15 14:04:53,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2021-12-15 14:04:53,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2021-12-15 14:04:53,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2021-12-15 14:04:53,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:53,636 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:04:53,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2021-12-15 14:04:53,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2021-12-15 14:04:53,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2021-12-15 14:04:53,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2021-12-15 14:04:53,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2021-12-15 14:04:53,679 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:53,698 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:04:53,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53 WrapperNode [2021-12-15 14:04:53,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:53,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:53,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:04:53,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:04:53,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,755 INFO L137 Inliner]: procedures = 122, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 159 [2021-12-15 14:04:53,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:53,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:04:53,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:04:53,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:04:53,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:04:53,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:04:53,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:04:53,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:04:53,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (1/1) ... [2021-12-15 14:04:53,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:53,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:53,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 14:04:53,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 14:04:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-15 14:04:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 14:04:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 14:04:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 14:04:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 14:04:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:04:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-15 14:04:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-15 14:04:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:04:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:04:53,942 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:04:53,943 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:04:54,484 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:04:54,489 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:04:54,489 INFO L301 CfgBuilder]: Removed 15 assume(true) statements. [2021-12-15 14:04:54,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:54 BoogieIcfgContainer [2021-12-15 14:04:54,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:04:54,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:04:54,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:04:54,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:04:54,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:04:53" (1/3) ... [2021-12-15 14:04:54,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126692f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:54, skipping insertion in model container [2021-12-15 14:04:54,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:53" (2/3) ... [2021-12-15 14:04:54,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126692f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:54, skipping insertion in model container [2021-12-15 14:04:54,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:54" (3/3) ... [2021-12-15 14:04:54,498 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2021-12-15 14:04:54,503 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:04:54,504 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2021-12-15 14:04:54,541 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:04:54,549 INFO L339 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 14:04:54,550 INFO L340 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2021-12-15 14:04:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 80 states have (on average 2.25) internal successors, (180), 152 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:54,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:54,574 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:54,575 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:54,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 14:04:54,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:54,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617460658] [2021-12-15 14:04:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:54,588 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:54,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:54,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:04:54,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-15 14:04:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:54,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 14:04:54,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:54,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:54,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:54,700 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:54,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617460658] [2021-12-15 14:04:54,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617460658] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:54,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:54,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:54,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763359957] [2021-12-15 14:04:54,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:54,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:54,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:54,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:54,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:54,725 INFO L87 Difference]: Start difference. First operand has 153 states, 80 states have (on average 2.25) internal successors, (180), 152 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:54,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:54,996 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2021-12-15 14:04:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:54,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-15 14:04:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:55,003 INFO L225 Difference]: With dead ends: 188 [2021-12-15 14:04:55,003 INFO L226 Difference]: Without dead ends: 184 [2021-12-15 14:04:55,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:55,007 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 139 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:55,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 118 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-15 14:04:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 147. [2021-12-15 14:04:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 79 states have (on average 1.9493670886075949) internal successors, (154), 146 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2021-12-15 14:04:55,042 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 3 [2021-12-15 14:04:55,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:55,043 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2021-12-15 14:04:55,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2021-12-15 14:04:55,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:55,044 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:55,044 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:55,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:55,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:04:55,251 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:55,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 14:04:55,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:55,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843988427] [2021-12-15 14:04:55,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:55,254 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:55,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:55,256 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:04:55,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-15 14:04:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:55,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 14:04:55,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:55,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:55,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:55,322 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:55,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843988427] [2021-12-15 14:04:55,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843988427] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:55,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:55,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:55,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720443219] [2021-12-15 14:04:55,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:55,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:55,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:55,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:55,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:55,324 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:55,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:55,566 INFO L93 Difference]: Finished difference Result 182 states and 191 transitions. [2021-12-15 14:04:55,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:55,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-15 14:04:55,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:55,568 INFO L225 Difference]: With dead ends: 182 [2021-12-15 14:04:55,568 INFO L226 Difference]: Without dead ends: 182 [2021-12-15 14:04:55,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:55,569 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 69 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:55,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 186 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-15 14:04:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 143. [2021-12-15 14:04:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 79 states have (on average 1.8987341772151898) internal successors, (150), 142 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2021-12-15 14:04:55,576 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 3 [2021-12-15 14:04:55,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:55,576 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2021-12-15 14:04:55,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2021-12-15 14:04:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 14:04:55,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:55,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:55,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:55,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:04:55,783 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924362, now seen corresponding path program 1 times [2021-12-15 14:04:55,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:55,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875059143] [2021-12-15 14:04:55,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:55,785 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:55,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:55,786 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:04:55,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-15 14:04:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:55,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 14:04:55,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:55,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:55,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:55,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-15 14:04:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:55,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:55,914 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:55,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875059143] [2021-12-15 14:04:55,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875059143] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:55,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:55,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:55,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585772125] [2021-12-15 14:04:55,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:55,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:55,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:55,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:55,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:55,916 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:56,373 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2021-12-15 14:04:56,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:04:56,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 14:04:56,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:56,374 INFO L225 Difference]: With dead ends: 149 [2021-12-15 14:04:56,375 INFO L226 Difference]: Without dead ends: 149 [2021-12-15 14:04:56,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:04:56,375 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 95 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:56,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 297 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:04:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-15 14:04:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 141. [2021-12-15 14:04:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 88 states have (on average 1.7727272727272727) internal successors, (156), 140 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 156 transitions. [2021-12-15 14:04:56,383 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 156 transitions. Word has length 10 [2021-12-15 14:04:56,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:56,384 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 156 transitions. [2021-12-15 14:04:56,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:56,384 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2021-12-15 14:04:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 14:04:56,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:56,384 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:56,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:56,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:04:56,591 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:56,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:56,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924363, now seen corresponding path program 1 times [2021-12-15 14:04:56,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:56,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081081875] [2021-12-15 14:04:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:56,592 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:56,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:56,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:04:56,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-15 14:04:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:56,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-15 14:04:56,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:56,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:56,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:56,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:56,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-15 14:04:56,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 14:04:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:56,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:56,754 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:56,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081081875] [2021-12-15 14:04:56,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081081875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:56,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:56,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:56,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787628574] [2021-12-15 14:04:56,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:56,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:56,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:56,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:56,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:56,757 INFO L87 Difference]: Start difference. First operand 141 states and 156 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:57,264 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2021-12-15 14:04:57,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:04:57,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 14:04:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:57,265 INFO L225 Difference]: With dead ends: 137 [2021-12-15 14:04:57,265 INFO L226 Difference]: Without dead ends: 137 [2021-12-15 14:04:57,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:04:57,266 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 6 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:57,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 406 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-15 14:04:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-15 14:04:57,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-12-15 14:04:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 88 states have (on average 1.7272727272727273) internal successors, (152), 136 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2021-12-15 14:04:57,271 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 10 [2021-12-15 14:04:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:57,271 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2021-12-15 14:04:57,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2021-12-15 14:04:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 14:04:57,272 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:57,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:57,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:57,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:04:57,479 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:57,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:57,479 INFO L85 PathProgramCache]: Analyzing trace with hash 592229104, now seen corresponding path program 1 times [2021-12-15 14:04:57,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:57,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444618398] [2021-12-15 14:04:57,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:57,479 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:57,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:57,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:04:57,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-15 14:04:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:57,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 14:04:57,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:57,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:57,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:57,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-15 14:04:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:57,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:57,660 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:57,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444618398] [2021-12-15 14:04:57,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444618398] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:57,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:57,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:57,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975801912] [2021-12-15 14:04:57,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:57,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:57,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:57,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:57,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:57,662 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:58,093 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2021-12-15 14:04:58,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:58,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 14:04:58,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:58,094 INFO L225 Difference]: With dead ends: 144 [2021-12-15 14:04:58,095 INFO L226 Difference]: Without dead ends: 144 [2021-12-15 14:04:58,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:58,096 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 92 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:58,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 289 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:04:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-15 14:04:58,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2021-12-15 14:04:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 88 states have (on average 1.7159090909090908) internal successors, (151), 135 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2021-12-15 14:04:58,100 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 17 [2021-12-15 14:04:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:58,101 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2021-12-15 14:04:58,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2021-12-15 14:04:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 14:04:58,101 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:58,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:58,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-15 14:04:58,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:04:58,310 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:58,311 INFO L85 PathProgramCache]: Analyzing trace with hash 592229105, now seen corresponding path program 1 times [2021-12-15 14:04:58,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:58,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769346109] [2021-12-15 14:04:58,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:58,311 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:58,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:58,313 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:04:58,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-15 14:04:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:58,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-15 14:04:58,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:58,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:58,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:58,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:58,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 14:04:58,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-15 14:04:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:58,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:58,491 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:58,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769346109] [2021-12-15 14:04:58,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769346109] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:58,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:58,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:58,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776982858] [2021-12-15 14:04:58,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:58,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:58,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:58,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:58,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:58,493 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:58,905 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2021-12-15 14:04:58,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:58,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 14:04:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:58,907 INFO L225 Difference]: With dead ends: 135 [2021-12-15 14:04:58,907 INFO L226 Difference]: Without dead ends: 135 [2021-12-15 14:04:58,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:58,908 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 7 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:58,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 393 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:04:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-15 14:04:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2021-12-15 14:04:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 88 states have (on average 1.6818181818181819) internal successors, (148), 132 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2021-12-15 14:04:58,912 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 17 [2021-12-15 14:04:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:58,912 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2021-12-15 14:04:58,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2021-12-15 14:04:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 14:04:58,913 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:58,913 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:58,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:59,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:04:59,120 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:59,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1689679642, now seen corresponding path program 1 times [2021-12-15 14:04:59,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:59,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358698243] [2021-12-15 14:04:59,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:59,121 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:59,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:59,122 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:04:59,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-15 14:04:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:59,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 14:04:59,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:59,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:59,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:59,248 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:59,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358698243] [2021-12-15 14:04:59,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358698243] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:59,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:59,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:59,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727554834] [2021-12-15 14:04:59,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:59,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:59,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:59,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:59,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:59,250 INFO L87 Difference]: Start difference. First operand 133 states and 148 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:59,384 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2021-12-15 14:04:59,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:59,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-15 14:04:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:59,385 INFO L225 Difference]: With dead ends: 138 [2021-12-15 14:04:59,385 INFO L226 Difference]: Without dead ends: 138 [2021-12-15 14:04:59,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:59,386 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 65 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:59,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 139 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:59,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-15 14:04:59,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2021-12-15 14:04:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 88 states have (on average 1.625) internal successors, (143), 127 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2021-12-15 14:04:59,390 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 22 [2021-12-15 14:04:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:59,390 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2021-12-15 14:04:59,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2021-12-15 14:04:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 14:04:59,391 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:59,391 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:59,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:59,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:04:59,592 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:59,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:59,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1689679643, now seen corresponding path program 1 times [2021-12-15 14:04:59,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:04:59,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924470307] [2021-12-15 14:04:59,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:59,593 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:04:59,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:04:59,594 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:04:59,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-15 14:04:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:59,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 14:04:59,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:59,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:59,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:04:59,735 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:04:59,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924470307] [2021-12-15 14:04:59,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924470307] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:59,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:59,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:59,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350699825] [2021-12-15 14:04:59,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:59,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:59,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:04:59,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:59,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:59,736 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:59,875 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2021-12-15 14:04:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:59,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-15 14:04:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:59,879 INFO L225 Difference]: With dead ends: 133 [2021-12-15 14:04:59,879 INFO L226 Difference]: Without dead ends: 133 [2021-12-15 14:04:59,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:59,879 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 60 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:59,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 140 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-15 14:04:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2021-12-15 14:04:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.5681818181818181) internal successors, (138), 122 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2021-12-15 14:04:59,882 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 22 [2021-12-15 14:04:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:59,883 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2021-12-15 14:04:59,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2021-12-15 14:04:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 14:04:59,883 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:59,883 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:59,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-15 14:05:00,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:05:00,093 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:05:00,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash 284576519, now seen corresponding path program 1 times [2021-12-15 14:05:00,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:00,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284257976] [2021-12-15 14:05:00,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:00,094 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:00,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:00,095 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:05:00,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-15 14:05:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:00,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 14:05:00,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:00,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:05:00,262 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-15 14:05:00,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2021-12-15 14:05:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:00,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:00,298 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:00,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284257976] [2021-12-15 14:05:00,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284257976] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:00,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:00,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:05:00,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507105250] [2021-12-15 14:05:00,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:00,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:05:00,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:00,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:05:00,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:05:00,300 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:00,578 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2021-12-15 14:05:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:05:00,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 14:05:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:00,579 INFO L225 Difference]: With dead ends: 173 [2021-12-15 14:05:00,579 INFO L226 Difference]: Without dead ends: 173 [2021-12-15 14:05:00,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:05:00,580 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 214 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:00,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 158 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:05:00,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-15 14:05:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 130. [2021-12-15 14:05:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 95 states have (on average 1.5789473684210527) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2021-12-15 14:05:00,582 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 24 [2021-12-15 14:05:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:00,583 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2021-12-15 14:05:00,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:00,583 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2021-12-15 14:05:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 14:05:00,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:00,584 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:00,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:00,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:05:00,791 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:05:00,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:00,792 INFO L85 PathProgramCache]: Analyzing trace with hash 284576520, now seen corresponding path program 1 times [2021-12-15 14:05:00,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:00,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318083344] [2021-12-15 14:05:00,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:00,792 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:00,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:00,793 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:05:00,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-15 14:05:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:00,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-15 14:05:00,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:00,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:05:00,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:05:00,986 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:00,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-15 14:05:00,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-15 14:05:01,056 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:01,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-15 14:05:01,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-15 14:05:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:01,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:01,125 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:01,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318083344] [2021-12-15 14:05:01,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318083344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:01,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:01,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 14:05:01,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663357815] [2021-12-15 14:05:01,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:01,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:05:01,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:01,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:05:01,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:05:01,126 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:01,623 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2021-12-15 14:05:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:05:01,624 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 14:05:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:01,626 INFO L225 Difference]: With dead ends: 223 [2021-12-15 14:05:01,626 INFO L226 Difference]: Without dead ends: 223 [2021-12-15 14:05:01,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-15 14:05:01,626 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 363 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:01,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 229 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:05:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-12-15 14:05:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 168. [2021-12-15 14:05:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 133 states have (on average 1.556390977443609) internal successors, (207), 167 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 207 transitions. [2021-12-15 14:05:01,632 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 207 transitions. Word has length 24 [2021-12-15 14:05:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:01,632 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 207 transitions. [2021-12-15 14:05:01,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 207 transitions. [2021-12-15 14:05:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 14:05:01,634 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:01,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:01,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:01,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:05:01,845 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:05:01,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:01,846 INFO L85 PathProgramCache]: Analyzing trace with hash 231938434, now seen corresponding path program 1 times [2021-12-15 14:05:01,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:01,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435895904] [2021-12-15 14:05:01,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:01,852 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:01,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:01,853 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:05:01,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-15 14:05:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:01,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 14:05:01,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:02,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:05:02,009 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:02,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435895904] [2021-12-15 14:05:02,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435895904] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:02,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:02,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:05:02,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86663616] [2021-12-15 14:05:02,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:02,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:05:02,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:05:02,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:05:02,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:05:02,011 INFO L87 Difference]: Start difference. First operand 168 states and 207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:02,160 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2021-12-15 14:05:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:05:02,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-15 14:05:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:02,161 INFO L225 Difference]: With dead ends: 206 [2021-12-15 14:05:02,161 INFO L226 Difference]: Without dead ends: 206 [2021-12-15 14:05:02,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:05:02,162 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 185 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:02,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 211 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:05:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-15 14:05:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 166. [2021-12-15 14:05:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 132 states have (on average 1.5378787878787878) internal successors, (203), 165 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:02,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 203 transitions. [2021-12-15 14:05:02,165 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 203 transitions. Word has length 25 [2021-12-15 14:05:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:02,165 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 203 transitions. [2021-12-15 14:05:02,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 203 transitions. [2021-12-15 14:05:02,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 14:05:02,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:02,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:02,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:02,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:05:02,367 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:05:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash -947079159, now seen corresponding path program 1 times [2021-12-15 14:05:02,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:05:02,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388212578] [2021-12-15 14:05:02,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:02,368 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:05:02,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:05:02,369 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:05:02,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-15 14:05:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:02,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-15 14:05:02,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:02,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:05:02,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:05:02,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:05:02,581 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:02,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-15 14:05:02,616 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-12-15 14:05:02,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:05:02,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:02,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:05:02,753 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:05:02,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-15 14:05:02,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 14:05:02,789 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:02,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-15 14:05:02,830 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:05:02,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-15 14:05:02,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 14:05:02,866 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:02,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-15 14:05:02,902 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:02,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-15 14:05:02,953 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:05:02,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-15 14:05:02,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 14:05:02,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:02,998 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-12-15 14:05:02,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 34 [2021-12-15 14:05:03,191 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-15 14:05:03,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-12-15 14:05:03,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-12-15 14:05:03,243 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:05:03,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-15 14:05:03,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 14:05:03,356 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-15 14:05:03,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2021-12-15 14:05:03,361 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:05:03,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388212578] [2021-12-15 14:05:03,361 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-15 14:05:03,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2144820207] [2021-12-15 14:05:03,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:03,362 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-15 14:05:03,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-15 14:05:03,363 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-15 14:05:03,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2021-12-15 14:05:03,424 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@41fcb162 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 14:05:03,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19077119] [2021-12-15 14:05:03,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:03,425 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:03,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:03,426 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:05:03,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-15 14:05:03,458 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@41fcb162 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 14:05:03,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:03,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-12-15 14:05:03,459 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-12-15 14:05:03,459 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-12-15 14:05:03,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (71 of 72 remaining) [2021-12-15 14:05:03,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (70 of 72 remaining) [2021-12-15 14:05:03,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (69 of 72 remaining) [2021-12-15 14:05:03,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (68 of 72 remaining) [2021-12-15 14:05:03,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (67 of 72 remaining) [2021-12-15 14:05:03,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (66 of 72 remaining) [2021-12-15 14:05:03,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (65 of 72 remaining) [2021-12-15 14:05:03,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (64 of 72 remaining) [2021-12-15 14:05:03,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (63 of 72 remaining) [2021-12-15 14:05:03,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (62 of 72 remaining) [2021-12-15 14:05:03,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (61 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (60 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (59 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (58 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (57 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (56 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (55 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (54 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (53 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (52 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (51 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (50 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (49 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (48 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (47 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (46 of 72 remaining) [2021-12-15 14:05:03,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (45 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (44 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (43 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (42 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (41 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (40 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK (39 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (38 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (37 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (36 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (35 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (34 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (33 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK (32 of 72 remaining) [2021-12-15 14:05:03,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (31 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (30 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (29 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (28 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (27 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (26 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (25 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (24 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (23 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (22 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (21 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (20 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (19 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (18 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (17 of 72 remaining) [2021-12-15 14:05:03,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (16 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (15 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (14 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (13 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (12 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (11 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK (10 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (9 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (8 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (7 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK (6 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION (5 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (4 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE (3 of 72 remaining) [2021-12-15 14:05:03,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE (2 of 72 remaining) [2021-12-15 14:05:03,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE (1 of 72 remaining) [2021-12-15 14:05:03,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK (0 of 72 remaining) [2021-12-15 14:05:03,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:03,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-15 14:05:03,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:04,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:04,072 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:04,074 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 14:05:04,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 02:05:04 BoogieIcfgContainer [2021-12-15 14:05:04,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 14:05:04,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 14:05:04,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 14:05:04,083 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 14:05:04,083 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:54" (3/4) ... [2021-12-15 14:05:04,085 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 14:05:04,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 14:05:04,086 INFO L158 Benchmark]: Toolchain (without parser) took 10754.78ms. Allocated memory was 58.7MB in the beginning and 104.9MB in the end (delta: 46.1MB). Free memory was 36.1MB in the beginning and 59.6MB in the end (delta: -23.5MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2021-12-15 14:05:04,086 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 14:05:04,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.40ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 35.9MB in the beginning and 45.4MB in the end (delta: -9.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 14:05:04,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.52ms. Allocated memory is still 71.3MB. Free memory was 45.4MB in the beginning and 43.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 14:05:04,086 INFO L158 Benchmark]: Boogie Preprocessor took 38.93ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 41.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 14:05:04,087 INFO L158 Benchmark]: RCFGBuilder took 695.15ms. Allocated memory is still 71.3MB. Free memory was 41.0MB in the beginning and 51.1MB in the end (delta: -10.1MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2021-12-15 14:05:04,087 INFO L158 Benchmark]: TraceAbstraction took 9590.42ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 50.8MB in the beginning and 59.6MB in the end (delta: -8.8MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2021-12-15 14:05:04,087 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 104.9MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 14:05:04,088 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.40ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 35.9MB in the beginning and 45.4MB in the end (delta: -9.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.52ms. Allocated memory is still 71.3MB. Free memory was 45.4MB in the beginning and 43.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.93ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 41.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 695.15ms. Allocated memory is still 71.3MB. Free memory was 41.0MB in the beginning and 51.1MB in the end (delta: -10.1MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9590.42ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 50.8MB in the beginning and 59.6MB in the end (delta: -8.8MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 104.9MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1004] BCK* bucket = malloc(sizeof(BCK)); [L1005] bucket->data = 0 [L1006] bucket->list = ((void*)0) [L1008] bucket->next = malloc(sizeof(BCK)) [L1009] EXPR bucket->next [L1009] BCK* bcki = bucket->next; [L1010] bcki->data = 1 [L1011] bcki->list = ((void*)0) [L1013] bcki->next = malloc(sizeof(BCK)) [L1014] EXPR bcki->next [L1014] bcki = bcki->next [L1015] bcki->data = 2 [L1016] bcki->list = ((void*)0) [L1017] bcki->next = ((void*)0) [L1019] struct TSLL* item = ((void*)0); [L1020] struct TSLL* itr = ((void*)0); [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1052] bcki = bucket [L1053] COND TRUE bcki != ((void*)0) [L1055] EXPR bcki->list [L1055] item = bcki->list [L1056] bcki->list = ((void*)0) [L1057] COND TRUE item != ((void*)0) [L1059] itr = item [L1060] item->next - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 153 locations, 72 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1295 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1295 mSDsluCounter, 2566 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1511 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1991 IncrementalHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 1055 mSDtfsCounter, 1991 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=10, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 252 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1602 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-15 14:05:04,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN