./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_14-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/locks/test_locks_14-2.c -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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:22,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:22,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:22,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:22,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:22,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:22,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:22,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:22,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:22,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:22,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:22,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:22,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:22,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:22,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:22,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:22,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:22,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:22,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:22,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:22,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:22,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:22,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:22,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:22,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:22,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:22,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:22,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:22,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:22,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:22,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:22,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:22,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:22,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:22,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:22,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:22,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:22,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:22,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:22,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:22,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:22,772 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-21 00:02:22,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:22,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:22,785 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:22,785 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:22,786 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:22,786 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:22,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:22,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:22,787 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:22,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:22,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:22,787 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:22,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:22,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:22,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:22,788 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:22,788 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:22,788 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:22,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:22,789 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:22,789 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:22,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:22,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:22,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:22,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:22,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:22,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:22,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:22,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:22,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:22,791 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2022-02-21 00:02:22,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:22,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:22,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:22,994 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:22,995 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:22,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2022-02-21 00:02:23,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6641eca3f/bff6add7f4ac49ebbe178cf32393f927/FLAG7a7180de9 [2022-02-21 00:02:23,460 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:23,461 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2022-02-21 00:02:23,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6641eca3f/bff6add7f4ac49ebbe178cf32393f927/FLAG7a7180de9 [2022-02-21 00:02:23,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6641eca3f/bff6add7f4ac49ebbe178cf32393f927 [2022-02-21 00:02:23,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:23,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:23,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:23,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:23,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:23,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:23" (1/1) ... [2022-02-21 00:02:23,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517c42a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:23, skipping insertion in model container [2022-02-21 00:02:23,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:23" (1/1) ... [2022-02-21 00:02:23,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:23,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:24,127 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/locks/test_locks_14-2.c[5305,5318] [2022-02-21 00:02:24,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:24,146 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:24,202 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/locks/test_locks_14-2.c[5305,5318] [2022-02-21 00:02:24,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:24,233 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:24,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:24 WrapperNode [2022-02-21 00:02:24,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:24,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:24,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:24,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:24,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:24" (1/1) ... [2022-02-21 00:02:24,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:24" (1/1) ... [2022-02-21 00:02:24,321 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 184 [2022-02-21 00:02:24,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:24,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:24,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:24,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:24,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:24" (1/1) ... [2022-02-21 00:02:24,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:24" (1/1) ... [2022-02-21 00:02:24,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:24" (1/1) ... [2022-02-21 00:02:24,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:24" (1/1) ... [2022-02-21 00:02:24,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:24" (1/1) ... [2022-02-21 00:02:24,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:24" (1/1) ... [2022-02-21 00:02:24,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:24" (1/1) ... [2022-02-21 00:02:24,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:24,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:24,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:24,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:24,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:24" (1/1) ... [2022-02-21 00:02:24,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:24,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:24,477 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) [2022-02-21 00:02:24,479 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 [2022-02-21 00:02:24,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:02:24,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:24,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:24,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 00:02:24,600 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:24,601 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:24,856 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:24,861 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:24,861 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 00:02:24,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:24 BoogieIcfgContainer [2022-02-21 00:02:24,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:24,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:24,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:24,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:24,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:23" (1/3) ... [2022-02-21 00:02:24,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48bff244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:24, skipping insertion in model container [2022-02-21 00:02:24,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:24" (2/3) ... [2022-02-21 00:02:24,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48bff244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:24, skipping insertion in model container [2022-02-21 00:02:24,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:24" (3/3) ... [2022-02-21 00:02:24,870 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2022-02-21 00:02:24,874 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:24,875 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-21 00:02:24,910 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:24,930 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 [2022-02-21 00:02:24,930 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-21 00:02:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 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) [2022-02-21 00:02:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 00:02:24,949 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:24,949 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 00:02:24,950 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:24,954 INFO L85 PathProgramCache]: Analyzing trace with hash 28943010, now seen corresponding path program 1 times [2022-02-21 00:02:24,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:24,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376014793] [2022-02-21 00:02:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:24,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:25,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {56#true} is VALID [2022-02-21 00:02:25,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {56#true} is VALID [2022-02-21 00:02:25,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {56#true} assume !true; {57#false} is VALID [2022-02-21 00:02:25,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {57#false} main_#res#1 := 0; {57#false} is VALID [2022-02-21 00:02:25,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {57#false} assume !(#valid == main_old_#valid#1); {57#false} is VALID [2022-02-21 00:02:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:25,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:25,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376014793] [2022-02-21 00:02:25,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376014793] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:25,209 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:25,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:25,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527770063] [2022-02-21 00:02:25,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:25,214 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-02-21 00:02:25,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:25,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-02-21 00:02:25,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 00:02:25,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:25,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 00:02:25,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 00:02:25,266 INFO L87 Difference]: Start difference. First operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-02-21 00:02:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,354 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. [2022-02-21 00:02:25,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 00:02:25,356 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-02-21 00:02:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-02-21 00:02:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-21 00:02:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-02-21 00:02:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-21 00:02:25,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 97 transitions. [2022-02-21 00:02:25,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,457 INFO L225 Difference]: With dead ends: 53 [2022-02-21 00:02:25,458 INFO L226 Difference]: Without dead ends: 51 [2022-02-21 00:02:25,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 00:02:25,461 INFO L933 BasicCegarLoop]: 94 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, 94 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:25,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:25,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-21 00:02:25,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-21 00:02:25,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:25,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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) [2022-02-21 00:02:25,484 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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) [2022-02-21 00:02:25,484 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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) [2022-02-21 00:02:25,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,488 INFO L93 Difference]: Finished difference Result 51 states and 92 transitions. [2022-02-21 00:02:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2022-02-21 00:02:25,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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 51 states. [2022-02-21 00:02:25,490 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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 51 states. [2022-02-21 00:02:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,493 INFO L93 Difference]: Finished difference Result 51 states and 92 transitions. [2022-02-21 00:02:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2022-02-21 00:02:25,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:25,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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) [2022-02-21 00:02:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 92 transitions. [2022-02-21 00:02:25,497 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 92 transitions. Word has length 5 [2022-02-21 00:02:25,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:25,498 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 92 transitions. [2022-02-21 00:02:25,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-02-21 00:02:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2022-02-21 00:02:25,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 00:02:25,499 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:25,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 00:02:25,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:25,499 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:25,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:25,500 INFO L85 PathProgramCache]: Analyzing trace with hash 889700139, now seen corresponding path program 1 times [2022-02-21 00:02:25,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:25,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647114512] [2022-02-21 00:02:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:25,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:25,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {266#true} is VALID [2022-02-21 00:02:25,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:25,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:25,547 INFO L290 TraceCheckUtils]: 3: Hoare triple {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume 0 == main_~cond~0#1; {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:25,547 INFO L290 TraceCheckUtils]: 4: Hoare triple {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#res#1 := 0; {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:25,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {267#false} is VALID [2022-02-21 00:02:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:25,548 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:25,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647114512] [2022-02-21 00:02:25,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647114512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:25,549 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:25,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:25,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735512929] [2022-02-21 00:02:25,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:25,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-21 00:02:25,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:25,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 00:02:25,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:25,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:25,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:25,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:25,559 INFO L87 Difference]: Start difference. First operand 51 states and 92 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 00:02:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,622 INFO L93 Difference]: Finished difference Result 50 states and 91 transitions. [2022-02-21 00:02:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:25,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-21 00:02:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 00:02:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-21 00:02:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 00:02:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-21 00:02:25,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2022-02-21 00:02:25,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,689 INFO L225 Difference]: With dead ends: 50 [2022-02-21 00:02:25,689 INFO L226 Difference]: Without dead ends: 48 [2022-02-21 00:02:25,690 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 [2022-02-21 00:02:25,691 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:25,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 91 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-21 00:02:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-21 00:02:25,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:25,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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) [2022-02-21 00:02:25,695 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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) [2022-02-21 00:02:25,696 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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) [2022-02-21 00:02:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,698 INFO L93 Difference]: Finished difference Result 48 states and 89 transitions. [2022-02-21 00:02:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2022-02-21 00:02:25,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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 48 states. [2022-02-21 00:02:25,699 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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 48 states. [2022-02-21 00:02:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,702 INFO L93 Difference]: Finished difference Result 48 states and 89 transitions. [2022-02-21 00:02:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2022-02-21 00:02:25,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:25,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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) [2022-02-21 00:02:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2022-02-21 00:02:25,705 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 6 [2022-02-21 00:02:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:25,705 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 89 transitions. [2022-02-21 00:02:25,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 00:02:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2022-02-21 00:02:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:25,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:25,707 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] [2022-02-21 00:02:25,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:25,707 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:25,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:25,708 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2022-02-21 00:02:25,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:25,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502703829] [2022-02-21 00:02:25,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:25,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:25,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {465#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {465#true} is VALID [2022-02-21 00:02:25,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {465#true} is VALID [2022-02-21 00:02:25,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {465#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {465#true} is VALID [2022-02-21 00:02:25,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {465#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {465#true} is VALID [2022-02-21 00:02:25,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {465#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p11~0#1); {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {466#false} is VALID [2022-02-21 00:02:25,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {466#false} assume !false; {466#false} is VALID [2022-02-21 00:02:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:25,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:25,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502703829] [2022-02-21 00:02:25,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502703829] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:25,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:25,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:25,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522396054] [2022-02-21 00:02:25,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:25,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:25,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:25,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:25,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:25,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:25,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:25,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:25,789 INFO L87 Difference]: Start difference. First operand 48 states and 89 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,879 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2022-02-21 00:02:25,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:25,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:25,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2022-02-21 00:02:25,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,998 INFO L225 Difference]: With dead ends: 93 [2022-02-21 00:02:25,998 INFO L226 Difference]: Without dead ends: 93 [2022-02-21 00:02:25,999 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 [2022-02-21 00:02:26,000 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:26,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-21 00:02:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2022-02-21 00:02:26,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:26,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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) [2022-02-21 00:02:26,005 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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) [2022-02-21 00:02:26,005 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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) [2022-02-21 00:02:26,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,008 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2022-02-21 00:02:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 173 transitions. [2022-02-21 00:02:26,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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 93 states. [2022-02-21 00:02:26,009 INFO L87 Difference]: Start difference. First operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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 93 states. [2022-02-21 00:02:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,012 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2022-02-21 00:02:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 173 transitions. [2022-02-21 00:02:26,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:26,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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) [2022-02-21 00:02:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2022-02-21 00:02:26,016 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2022-02-21 00:02:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:26,017 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2022-02-21 00:02:26,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2022-02-21 00:02:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:26,017 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:26,018 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] [2022-02-21 00:02:26,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:02:26,018 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:26,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash 792950571, now seen corresponding path program 1 times [2022-02-21 00:02:26,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:26,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214156434] [2022-02-21 00:02:26,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:26,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {812#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {812#true} is VALID [2022-02-21 00:02:26,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {812#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {812#true} is VALID [2022-02-21 00:02:26,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {812#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {812#true} is VALID [2022-02-21 00:02:26,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {812#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {812#true} is VALID [2022-02-21 00:02:26,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {812#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:26,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {814#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {813#false} is VALID [2022-02-21 00:02:26,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {813#false} assume !(0 != main_~p2~0#1); {813#false} is VALID [2022-02-21 00:02:26,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {813#false} assume !false; {813#false} is VALID [2022-02-21 00:02:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:26,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:26,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214156434] [2022-02-21 00:02:26,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214156434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:26,070 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:26,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:26,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916010912] [2022-02-21 00:02:26,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:26,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:26,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:26,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:26,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:26,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:26,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:26,086 INFO L87 Difference]: Start difference. First operand 63 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,177 INFO L93 Difference]: Finished difference Result 94 states and 173 transitions. [2022-02-21 00:02:26,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:26,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:26,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2022-02-21 00:02:26,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,296 INFO L225 Difference]: With dead ends: 94 [2022-02-21 00:02:26,296 INFO L226 Difference]: Without dead ends: 94 [2022-02-21 00:02:26,297 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 [2022-02-21 00:02:26,298 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 71 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:26,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:26,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-21 00:02:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-02-21 00:02:26,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:26,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 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) [2022-02-21 00:02:26,303 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 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) [2022-02-21 00:02:26,303 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 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) [2022-02-21 00:02:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,306 INFO L93 Difference]: Finished difference Result 94 states and 173 transitions. [2022-02-21 00:02:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2022-02-21 00:02:26,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 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 94 states. [2022-02-21 00:02:26,307 INFO L87 Difference]: Start difference. First operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 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 94 states. [2022-02-21 00:02:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,309 INFO L93 Difference]: Finished difference Result 94 states and 173 transitions. [2022-02-21 00:02:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2022-02-21 00:02:26,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:26,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 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) [2022-02-21 00:02:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2022-02-21 00:02:26,313 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 21 [2022-02-21 00:02:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:26,313 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2022-02-21 00:02:26,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2022-02-21 00:02:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:26,314 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:26,314 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] [2022-02-21 00:02:26,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:02:26,315 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:26,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:26,315 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2022-02-21 00:02:26,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:26,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250679725] [2022-02-21 00:02:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:26,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:26,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {1191#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1191#true} is VALID [2022-02-21 00:02:26,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {1191#true} is VALID [2022-02-21 00:02:26,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {1191#true} is VALID [2022-02-21 00:02:26,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {1191#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {1191#true} is VALID [2022-02-21 00:02:26,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {1191#true} assume !(0 != main_~p1~0#1); {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p11~0#1); {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:26,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {1193#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {1192#false} is VALID [2022-02-21 00:02:26,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {1192#false} assume 1 != main_~lk1~0#1; {1192#false} is VALID [2022-02-21 00:02:26,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-02-21 00:02:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:26,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:26,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250679725] [2022-02-21 00:02:26,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250679725] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:26,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:26,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:26,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408761048] [2022-02-21 00:02:26,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:26,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:26,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:26,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:26,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:26,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:26,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:26,386 INFO L87 Difference]: Start difference. First operand 92 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,471 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2022-02-21 00:02:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:26,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-02-21 00:02:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-02-21 00:02:26,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 172 transitions. [2022-02-21 00:02:26,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,589 INFO L225 Difference]: With dead ends: 96 [2022-02-21 00:02:26,589 INFO L226 Difference]: Without dead ends: 96 [2022-02-21 00:02:26,589 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 [2022-02-21 00:02:26,590 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:26,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 198 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:26,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-21 00:02:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-02-21 00:02:26,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:26,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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) [2022-02-21 00:02:26,595 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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) [2022-02-21 00:02:26,595 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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) [2022-02-21 00:02:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,597 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2022-02-21 00:02:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 173 transitions. [2022-02-21 00:02:26,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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 96 states. [2022-02-21 00:02:26,598 INFO L87 Difference]: Start difference. First operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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 96 states. [2022-02-21 00:02:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,601 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2022-02-21 00:02:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 173 transitions. [2022-02-21 00:02:26,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:26,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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) [2022-02-21 00:02:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2022-02-21 00:02:26,604 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 21 [2022-02-21 00:02:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:26,604 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2022-02-21 00:02:26,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2022-02-21 00:02:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:26,605 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:26,605 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] [2022-02-21 00:02:26,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 00:02:26,605 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:26,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash -795397331, now seen corresponding path program 1 times [2022-02-21 00:02:26,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:26,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641368572] [2022-02-21 00:02:26,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:26,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:26,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {1578#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1578#true} is VALID [2022-02-21 00:02:26,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {1578#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {1578#true} is VALID [2022-02-21 00:02:26,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {1578#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {1578#true} is VALID [2022-02-21 00:02:26,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {1578#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {1578#true} is VALID [2022-02-21 00:02:26,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {1578#true} assume !(0 != main_~p1~0#1); {1578#true} is VALID [2022-02-21 00:02:26,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {1578#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p11~0#1); {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {1580#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {1579#false} is VALID [2022-02-21 00:02:26,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {1579#false} assume !false; {1579#false} is VALID [2022-02-21 00:02:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:26,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:26,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641368572] [2022-02-21 00:02:26,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641368572] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:26,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:26,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:26,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814002340] [2022-02-21 00:02:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:26,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:26,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:26,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:26,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:26,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:26,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:26,662 INFO L87 Difference]: Start difference. First operand 94 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,722 INFO L93 Difference]: Finished difference Result 127 states and 228 transitions. [2022-02-21 00:02:26,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:26,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-02-21 00:02:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-02-21 00:02:26,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 124 transitions. [2022-02-21 00:02:26,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,813 INFO L225 Difference]: With dead ends: 127 [2022-02-21 00:02:26,813 INFO L226 Difference]: Without dead ends: 127 [2022-02-21 00:02:26,814 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 [2022-02-21 00:02:26,814 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 70 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:26,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-21 00:02:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-02-21 00:02:26,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:26,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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) [2022-02-21 00:02:26,819 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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) [2022-02-21 00:02:26,819 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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) [2022-02-21 00:02:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,822 INFO L93 Difference]: Finished difference Result 127 states and 228 transitions. [2022-02-21 00:02:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 228 transitions. [2022-02-21 00:02:26,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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 127 states. [2022-02-21 00:02:26,823 INFO L87 Difference]: Start difference. First operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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 127 states. [2022-02-21 00:02:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,826 INFO L93 Difference]: Finished difference Result 127 states and 228 transitions. [2022-02-21 00:02:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 228 transitions. [2022-02-21 00:02:26,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:26,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:26,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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) [2022-02-21 00:02:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 227 transitions. [2022-02-21 00:02:26,829 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 227 transitions. Word has length 21 [2022-02-21 00:02:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:26,829 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 227 transitions. [2022-02-21 00:02:26,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:26,830 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 227 transitions. [2022-02-21 00:02:26,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:26,830 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:26,830 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] [2022-02-21 00:02:26,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 00:02:26,831 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:26,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:26,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1816465685, now seen corresponding path program 1 times [2022-02-21 00:02:26,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:26,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871946818] [2022-02-21 00:02:26,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:26,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:02:26,849 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 00:02:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:02:26,873 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 00:02:26,874 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 00:02:26,874 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-02-21 00:02:26,876 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-02-21 00:02:26,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 00:02:26,878 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:26,880 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:02:26,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:02:26 BoogieIcfgContainer [2022-02-21 00:02:26,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:02:26,913 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:02:26,913 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:02:26,913 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:02:26,914 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:24" (3/4) ... [2022-02-21 00:02:26,916 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 00:02:26,916 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:02:26,917 INFO L158 Benchmark]: Toolchain (without parser) took 3056.08ms. Allocated memory was 104.9MB in the beginning and 176.2MB in the end (delta: 71.3MB). Free memory was 74.4MB in the beginning and 136.5MB in the end (delta: -62.1MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-02-21 00:02:26,917 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:26,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.67ms. Allocated memory is still 104.9MB. Free memory was 74.4MB in the beginning and 78.8MB in the end (delta: -4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 00:02:26,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.36ms. Allocated memory is still 104.9MB. Free memory was 78.8MB in the beginning and 76.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:02:26,918 INFO L158 Benchmark]: Boogie Preprocessor took 69.55ms. Allocated memory is still 104.9MB. Free memory was 76.4MB in the beginning and 75.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:02:26,918 INFO L158 Benchmark]: RCFGBuilder took 454.47ms. Allocated memory is still 104.9MB. Free memory was 75.1MB in the beginning and 55.3MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-21 00:02:26,919 INFO L158 Benchmark]: TraceAbstraction took 2048.24ms. Allocated memory was 104.9MB in the beginning and 176.2MB in the end (delta: 71.3MB). Free memory was 54.6MB in the beginning and 136.5MB in the end (delta: -81.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:26,919 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 176.2MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:26,920 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.67ms. Allocated memory is still 104.9MB. Free memory was 74.4MB in the beginning and 78.8MB in the end (delta: -4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.36ms. Allocated memory is still 104.9MB. Free memory was 78.8MB in the beginning and 76.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.55ms. Allocated memory is still 104.9MB. Free memory was 76.4MB in the beginning and 75.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 454.47ms. Allocated memory is still 104.9MB. Free memory was 75.1MB in the beginning and 55.3MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2048.24ms. Allocated memory was 104.9MB in the beginning and 176.2MB in the end (delta: 71.3MB). Free memory was 54.6MB in the beginning and 136.5MB in the end (delta: -81.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 176.2MB. Free memory is still 136.5MB. 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: 219]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 219. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; VAL [p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L88] COND FALSE !(p1 != 0) VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L92] COND FALSE !(p2 != 0) VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L96] COND FALSE !(p3 != 0) VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L128] COND FALSE !(p11 != 0) VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L146] COND FALSE !(p1 != 0) VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L151] COND FALSE !(p2 != 0) VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L219] reach_error() VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] - UnprovableResult [Line: 6]: 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, 53 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 906 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 624 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=6, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 [2022-02-21 00:02:26,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/locks/test_locks_14-2.c -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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:29,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:29,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:29,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:29,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:29,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:29,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:29,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:29,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:29,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:29,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:29,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:29,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:29,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:29,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:29,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:29,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:29,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:29,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:29,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:29,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:29,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:29,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:29,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:29,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:29,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:29,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:29,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:29,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:29,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:29,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:29,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:29,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:29,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:29,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:29,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:29,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:29,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:29,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:29,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:29,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:29,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-21 00:02:29,261 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:29,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:29,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:29,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:29,264 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:29,264 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:29,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:29,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:29,266 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:29,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:29,267 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:29,267 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:29,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:29,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:29,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:29,268 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:29,268 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:29,268 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:29,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:29,268 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:29,268 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-21 00:02:29,269 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-21 00:02:29,280 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:29,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:29,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:29,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:29,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:29,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:29,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:29,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:29,281 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-21 00:02:29,281 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-21 00:02:29,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-21 00:02:29,282 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2022-02-21 00:02:29,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:29,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:29,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:29,816 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:29,817 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:29,818 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2022-02-21 00:02:29,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0944596/7f07397a610d406fbd35d28854553d7f/FLAGeaf9113d8 [2022-02-21 00:02:30,529 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:30,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2022-02-21 00:02:30,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0944596/7f07397a610d406fbd35d28854553d7f/FLAGeaf9113d8 [2022-02-21 00:02:30,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0944596/7f07397a610d406fbd35d28854553d7f [2022-02-21 00:02:30,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:30,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:30,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:30,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:30,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:30,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:30" (1/1) ... [2022-02-21 00:02:30,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13216d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:30, skipping insertion in model container [2022-02-21 00:02:30,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:30" (1/1) ... [2022-02-21 00:02:31,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:31,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:31,147 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/locks/test_locks_14-2.c[5305,5318] [2022-02-21 00:02:31,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:31,157 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:31,230 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/locks/test_locks_14-2.c[5305,5318] [2022-02-21 00:02:31,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:31,252 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:31,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:31 WrapperNode [2022-02-21 00:02:31,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:31,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:31,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:31,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:31,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:31" (1/1) ... [2022-02-21 00:02:31,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:31" (1/1) ... [2022-02-21 00:02:31,349 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2022-02-21 00:02:31,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:31,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:31,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:31,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:31,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:31" (1/1) ... [2022-02-21 00:02:31,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:31" (1/1) ... [2022-02-21 00:02:31,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:31" (1/1) ... [2022-02-21 00:02:31,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:31" (1/1) ... [2022-02-21 00:02:31,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:31" (1/1) ... [2022-02-21 00:02:31,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:31" (1/1) ... [2022-02-21 00:02:31,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:31" (1/1) ... [2022-02-21 00:02:31,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:31,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:31,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:31,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:31,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:31" (1/1) ... [2022-02-21 00:02:31,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:31,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:31,436 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) [2022-02-21 00:02:31,441 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 [2022-02-21 00:02:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:02:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:31,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-21 00:02:31,571 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:31,572 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:31,815 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:31,820 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:31,820 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 00:02:31,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:31 BoogieIcfgContainer [2022-02-21 00:02:31,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:31,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:31,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:31,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:31,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:30" (1/3) ... [2022-02-21 00:02:31,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1decd7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:31, skipping insertion in model container [2022-02-21 00:02:31,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:31" (2/3) ... [2022-02-21 00:02:31,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1decd7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:31, skipping insertion in model container [2022-02-21 00:02:31,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:31" (3/3) ... [2022-02-21 00:02:31,827 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2022-02-21 00:02:31,830 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:31,831 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-21 00:02:31,859 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:31,864 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 [2022-02-21 00:02:31,864 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-21 00:02:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 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) [2022-02-21 00:02:31,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 00:02:31,896 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:31,897 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 00:02:31,897 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:31,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash 28943010, now seen corresponding path program 1 times [2022-02-21 00:02:31,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:02:31,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372164451] [2022-02-21 00:02:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:31,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:02:31,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:02:31,941 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) [2022-02-21 00:02:31,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-21 00:02:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:31,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-21 00:02:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:31,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:32,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {56#true} is VALID [2022-02-21 00:02:32,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {56#true} is VALID [2022-02-21 00:02:32,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {56#true} assume !true; {57#false} is VALID [2022-02-21 00:02:32,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {57#false} main_#res#1 := 0bv32; {57#false} is VALID [2022-02-21 00:02:32,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {57#false} assume !(#valid == main_old_#valid#1); {57#false} is VALID [2022-02-21 00:02:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:32,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:02:32,033 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:02:32,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372164451] [2022-02-21 00:02:32,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372164451] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:32,034 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:32,034 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:32,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775213151] [2022-02-21 00:02:32,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:32,039 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-02-21 00:02:32,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:32,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-02-21 00:02:32,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:32,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 00:02:32,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:02:32,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 00:02:32,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 00:02:32,070 INFO L87 Difference]: Start difference. First operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-02-21 00:02:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,150 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. [2022-02-21 00:02:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 00:02:32,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-02-21 00:02:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-02-21 00:02:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-21 00:02:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-02-21 00:02:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-21 00:02:32,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 97 transitions. [2022-02-21 00:02:32,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:32,263 INFO L225 Difference]: With dead ends: 53 [2022-02-21 00:02:32,263 INFO L226 Difference]: Without dead ends: 51 [2022-02-21 00:02:32,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 00:02:32,267 INFO L933 BasicCegarLoop]: 94 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, 94 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:32,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-21 00:02:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-21 00:02:32,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:32,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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) [2022-02-21 00:02:32,289 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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) [2022-02-21 00:02:32,290 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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) [2022-02-21 00:02:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,293 INFO L93 Difference]: Finished difference Result 51 states and 92 transitions. [2022-02-21 00:02:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2022-02-21 00:02:32,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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 51 states. [2022-02-21 00:02:32,294 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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 51 states. [2022-02-21 00:02:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,297 INFO L93 Difference]: Finished difference Result 51 states and 92 transitions. [2022-02-21 00:02:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2022-02-21 00:02:32,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:32,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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) [2022-02-21 00:02:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 92 transitions. [2022-02-21 00:02:32,302 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 92 transitions. Word has length 5 [2022-02-21 00:02:32,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:32,302 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 92 transitions. [2022-02-21 00:02:32,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-02-21 00:02:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2022-02-21 00:02:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 00:02:32,303 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:32,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 00:02:32,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:32,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:02:32,514 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:32,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:32,517 INFO L85 PathProgramCache]: Analyzing trace with hash 889700139, now seen corresponding path program 1 times [2022-02-21 00:02:32,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:02:32,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745664694] [2022-02-21 00:02:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:32,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:02:32,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:02:32,519 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) [2022-02-21 00:02:32,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-21 00:02:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:32,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 00:02:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:32,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:32,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {278#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {278#true} is VALID [2022-02-21 00:02:32,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {286#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:32,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {286#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:32,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {286#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume 0bv32 == main_~cond~0#1; {286#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:32,583 INFO L290 TraceCheckUtils]: 4: Hoare triple {286#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} main_#res#1 := 0bv32; {286#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:32,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {286#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {279#false} is VALID [2022-02-21 00:02:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:32,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:02:32,584 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:02:32,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745664694] [2022-02-21 00:02:32,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745664694] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:32,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:32,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:32,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717833520] [2022-02-21 00:02:32,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:32,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-21 00:02:32,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:32,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 00:02:32,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:32,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:32,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:02:32,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:32,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:32,594 INFO L87 Difference]: Start difference. First operand 51 states and 92 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 00:02:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,657 INFO L93 Difference]: Finished difference Result 50 states and 91 transitions. [2022-02-21 00:02:32,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:32,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-21 00:02:32,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:32,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 00:02:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-21 00:02:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 00:02:32,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-21 00:02:32,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2022-02-21 00:02:32,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:32,729 INFO L225 Difference]: With dead ends: 50 [2022-02-21 00:02:32,729 INFO L226 Difference]: Without dead ends: 48 [2022-02-21 00:02:32,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:32,731 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:32,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 91 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-21 00:02:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-21 00:02:32,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:32,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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) [2022-02-21 00:02:32,735 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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) [2022-02-21 00:02:32,735 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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) [2022-02-21 00:02:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,737 INFO L93 Difference]: Finished difference Result 48 states and 89 transitions. [2022-02-21 00:02:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2022-02-21 00:02:32,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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 48 states. [2022-02-21 00:02:32,738 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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 48 states. [2022-02-21 00:02:32,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,740 INFO L93 Difference]: Finished difference Result 48 states and 89 transitions. [2022-02-21 00:02:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2022-02-21 00:02:32,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:32,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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) [2022-02-21 00:02:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2022-02-21 00:02:32,742 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 6 [2022-02-21 00:02:32,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:32,742 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 89 transitions. [2022-02-21 00:02:32,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 00:02:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2022-02-21 00:02:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:32,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:32,743 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] [2022-02-21 00:02:32,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:32,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:02:32,950 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:32,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:32,951 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2022-02-21 00:02:32,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:02:32,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988737432] [2022-02-21 00:02:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:32,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:02:32,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:02:32,953 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) [2022-02-21 00:02:32,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-21 00:02:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:32,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 00:02:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:32,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:33,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {492#true} is VALID [2022-02-21 00:02:33,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {492#true} is VALID [2022-02-21 00:02:33,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#true} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {492#true} is VALID [2022-02-21 00:02:33,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {492#true} assume !(0bv32 == main_~cond~0#1);main_~lk1~0#1 := 0bv32;main_~lk2~0#1 := 0bv32;main_~lk3~0#1 := 0bv32;main_~lk4~0#1 := 0bv32;main_~lk5~0#1 := 0bv32;main_~lk6~0#1 := 0bv32;main_~lk7~0#1 := 0bv32;main_~lk8~0#1 := 0bv32;main_~lk9~0#1 := 0bv32;main_~lk10~0#1 := 0bv32;main_~lk11~0#1 := 0bv32;main_~lk12~0#1 := 0bv32;main_~lk13~0#1 := 0bv32;main_~lk14~0#1 := 0bv32; {492#true} is VALID [2022-02-21 00:02:33,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {492#true} assume 0bv32 != main_~p1~0#1;main_~lk1~0#1 := 1bv32; {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume 0bv32 != main_~p2~0#1;main_~lk2~0#1 := 1bv32; {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume !(0bv32 != main_~p3~0#1); {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume 0bv32 != main_~p4~0#1;main_~lk4~0#1 := 1bv32; {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume 0bv32 != main_~p5~0#1;main_~lk5~0#1 := 1bv32; {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume 0bv32 != main_~p6~0#1;main_~lk6~0#1 := 1bv32; {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume 0bv32 != main_~p7~0#1;main_~lk7~0#1 := 1bv32; {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume 0bv32 != main_~p8~0#1;main_~lk8~0#1 := 1bv32; {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume 0bv32 != main_~p9~0#1;main_~lk9~0#1 := 1bv32; {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume 0bv32 != main_~p10~0#1;main_~lk10~0#1 := 1bv32; {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume !(0bv32 != main_~p11~0#1); {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume 0bv32 != main_~p12~0#1;main_~lk12~0#1 := 1bv32; {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume 0bv32 != main_~p13~0#1;main_~lk13~0#1 := 1bv32; {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume 0bv32 != main_~p14~0#1;main_~lk14~0#1 := 1bv32; {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume 0bv32 != main_~p1~0#1; {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} is VALID [2022-02-21 00:02:33,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {509#(= (_ bv1 32) |ULTIMATE.start_main_~lk1~0#1|)} assume 1bv32 != main_~lk1~0#1; {493#false} is VALID [2022-02-21 00:02:33,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {493#false} assume !false; {493#false} is VALID [2022-02-21 00:02:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:33,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:02:33,096 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:02:33,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988737432] [2022-02-21 00:02:33,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988737432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:33,097 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:33,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:33,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117769770] [2022-02-21 00:02:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:33,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:33,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:33,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:33,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:33,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:33,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:02:33,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:33,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:33,118 INFO L87 Difference]: Start difference. First operand 48 states and 89 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,235 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2022-02-21 00:02:33,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:33,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:33,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2022-02-21 00:02:33,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:33,379 INFO L225 Difference]: With dead ends: 93 [2022-02-21 00:02:33,379 INFO L226 Difference]: Without dead ends: 93 [2022-02-21 00:02:33,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:33,380 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:33,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:33,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-21 00:02:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2022-02-21 00:02:33,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:33,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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) [2022-02-21 00:02:33,385 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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) [2022-02-21 00:02:33,385 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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) [2022-02-21 00:02:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,387 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2022-02-21 00:02:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 173 transitions. [2022-02-21 00:02:33,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:33,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:33,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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 93 states. [2022-02-21 00:02:33,389 INFO L87 Difference]: Start difference. First operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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 93 states. [2022-02-21 00:02:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,391 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2022-02-21 00:02:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 173 transitions. [2022-02-21 00:02:33,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:33,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:33,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:33,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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) [2022-02-21 00:02:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2022-02-21 00:02:33,394 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2022-02-21 00:02:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:33,394 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2022-02-21 00:02:33,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2022-02-21 00:02:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:33,395 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:33,395 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] [2022-02-21 00:02:33,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:33,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:02:33,610 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:33,611 INFO L85 PathProgramCache]: Analyzing trace with hash 792950571, now seen corresponding path program 1 times [2022-02-21 00:02:33,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:02:33,612 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067797091] [2022-02-21 00:02:33,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:33,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:02:33,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:02:33,615 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) [2022-02-21 00:02:33,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-21 00:02:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:33,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 00:02:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:33,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:33,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {899#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {899#true} is VALID [2022-02-21 00:02:33,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {899#true} is VALID [2022-02-21 00:02:33,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {899#true} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {899#true} is VALID [2022-02-21 00:02:33,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {899#true} assume !(0bv32 == main_~cond~0#1);main_~lk1~0#1 := 0bv32;main_~lk2~0#1 := 0bv32;main_~lk3~0#1 := 0bv32;main_~lk4~0#1 := 0bv32;main_~lk5~0#1 := 0bv32;main_~lk6~0#1 := 0bv32;main_~lk7~0#1 := 0bv32;main_~lk8~0#1 := 0bv32;main_~lk9~0#1 := 0bv32;main_~lk10~0#1 := 0bv32;main_~lk11~0#1 := 0bv32;main_~lk12~0#1 := 0bv32;main_~lk13~0#1 := 0bv32;main_~lk14~0#1 := 0bv32; {899#true} is VALID [2022-02-21 00:02:33,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {899#true} assume 0bv32 != main_~p1~0#1;main_~lk1~0#1 := 1bv32; {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume 0bv32 != main_~p2~0#1;main_~lk2~0#1 := 1bv32; {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume !(0bv32 != main_~p3~0#1); {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume 0bv32 != main_~p4~0#1;main_~lk4~0#1 := 1bv32; {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume 0bv32 != main_~p5~0#1;main_~lk5~0#1 := 1bv32; {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume 0bv32 != main_~p6~0#1;main_~lk6~0#1 := 1bv32; {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume 0bv32 != main_~p7~0#1;main_~lk7~0#1 := 1bv32; {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume 0bv32 != main_~p8~0#1;main_~lk8~0#1 := 1bv32; {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume 0bv32 != main_~p9~0#1;main_~lk9~0#1 := 1bv32; {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume 0bv32 != main_~p10~0#1;main_~lk10~0#1 := 1bv32; {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume !(0bv32 != main_~p11~0#1); {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume 0bv32 != main_~p12~0#1;main_~lk12~0#1 := 1bv32; {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume 0bv32 != main_~p13~0#1;main_~lk13~0#1 := 1bv32; {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume 0bv32 != main_~p14~0#1;main_~lk14~0#1 := 1bv32; {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:33,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {916#(not (= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32)))} assume !(0bv32 != main_~p1~0#1); {900#false} is VALID [2022-02-21 00:02:33,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#false} assume !(0bv32 != main_~p2~0#1); {900#false} is VALID [2022-02-21 00:02:33,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#false} assume !false; {900#false} is VALID [2022-02-21 00:02:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:33,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:02:33,800 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:02:33,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067797091] [2022-02-21 00:02:33,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067797091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:33,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:33,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:33,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378731336] [2022-02-21 00:02:33,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:33,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:33,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:33,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:33,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:33,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:33,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:02:33,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:33,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:33,840 INFO L87 Difference]: Start difference. First operand 63 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:34,013 INFO L93 Difference]: Finished difference Result 94 states and 173 transitions. [2022-02-21 00:02:34,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:34,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:34,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2022-02-21 00:02:34,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:34,176 INFO L225 Difference]: With dead ends: 94 [2022-02-21 00:02:34,176 INFO L226 Difference]: Without dead ends: 94 [2022-02-21 00:02:34,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:34,177 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 71 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:34,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-21 00:02:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-02-21 00:02:34,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:34,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 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) [2022-02-21 00:02:34,183 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 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) [2022-02-21 00:02:34,188 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 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) [2022-02-21 00:02:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:34,190 INFO L93 Difference]: Finished difference Result 94 states and 173 transitions. [2022-02-21 00:02:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2022-02-21 00:02:34,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:34,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:34,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 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 94 states. [2022-02-21 00:02:34,197 INFO L87 Difference]: Start difference. First operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 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 94 states. [2022-02-21 00:02:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:34,202 INFO L93 Difference]: Finished difference Result 94 states and 173 transitions. [2022-02-21 00:02:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2022-02-21 00:02:34,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:34,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:34,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:34,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 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) [2022-02-21 00:02:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2022-02-21 00:02:34,206 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 21 [2022-02-21 00:02:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:34,207 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2022-02-21 00:02:34,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2022-02-21 00:02:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:34,207 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:34,207 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] [2022-02-21 00:02:34,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-21 00:02:34,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:02:34,414 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2022-02-21 00:02:34,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:02:34,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878668874] [2022-02-21 00:02:34,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:34,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:02:34,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:02:34,427 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) [2022-02-21 00:02:34,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-21 00:02:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:34,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 00:02:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:34,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:34,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {1338#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1338#true} is VALID [2022-02-21 00:02:34,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {1338#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {1338#true} is VALID [2022-02-21 00:02:34,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {1338#true} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {1338#true} is VALID [2022-02-21 00:02:34,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {1338#true} assume !(0bv32 == main_~cond~0#1);main_~lk1~0#1 := 0bv32;main_~lk2~0#1 := 0bv32;main_~lk3~0#1 := 0bv32;main_~lk4~0#1 := 0bv32;main_~lk5~0#1 := 0bv32;main_~lk6~0#1 := 0bv32;main_~lk7~0#1 := 0bv32;main_~lk8~0#1 := 0bv32;main_~lk9~0#1 := 0bv32;main_~lk10~0#1 := 0bv32;main_~lk11~0#1 := 0bv32;main_~lk12~0#1 := 0bv32;main_~lk13~0#1 := 0bv32;main_~lk14~0#1 := 0bv32; {1338#true} is VALID [2022-02-21 00:02:34,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {1338#true} assume !(0bv32 != main_~p1~0#1); {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume 0bv32 != main_~p2~0#1;main_~lk2~0#1 := 1bv32; {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume !(0bv32 != main_~p3~0#1); {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume 0bv32 != main_~p4~0#1;main_~lk4~0#1 := 1bv32; {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume 0bv32 != main_~p5~0#1;main_~lk5~0#1 := 1bv32; {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume 0bv32 != main_~p6~0#1;main_~lk6~0#1 := 1bv32; {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume 0bv32 != main_~p7~0#1;main_~lk7~0#1 := 1bv32; {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume 0bv32 != main_~p8~0#1;main_~lk8~0#1 := 1bv32; {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume 0bv32 != main_~p9~0#1;main_~lk9~0#1 := 1bv32; {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume 0bv32 != main_~p10~0#1;main_~lk10~0#1 := 1bv32; {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume !(0bv32 != main_~p11~0#1); {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume 0bv32 != main_~p12~0#1;main_~lk12~0#1 := 1bv32; {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume 0bv32 != main_~p13~0#1;main_~lk13~0#1 := 1bv32; {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume 0bv32 != main_~p14~0#1;main_~lk14~0#1 := 1bv32; {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} is VALID [2022-02-21 00:02:34,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {1355#(= |ULTIMATE.start_main_~p1~0#1| (_ bv0 32))} assume 0bv32 != main_~p1~0#1; {1339#false} is VALID [2022-02-21 00:02:34,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {1339#false} assume 1bv32 != main_~lk1~0#1; {1339#false} is VALID [2022-02-21 00:02:34,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {1339#false} assume !false; {1339#false} is VALID [2022-02-21 00:02:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:34,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:02:34,537 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:02:34,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878668874] [2022-02-21 00:02:34,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878668874] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:34,537 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:34,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:34,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087078527] [2022-02-21 00:02:34,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:34,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:34,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:34,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:34,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:34,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:34,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:02:34,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:34,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:34,556 INFO L87 Difference]: Start difference. First operand 92 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:34,660 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2022-02-21 00:02:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:34,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-02-21 00:02:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-02-21 00:02:34,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 172 transitions. [2022-02-21 00:02:34,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:34,776 INFO L225 Difference]: With dead ends: 96 [2022-02-21 00:02:34,776 INFO L226 Difference]: Without dead ends: 96 [2022-02-21 00:02:34,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:34,776 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:34,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 198 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-21 00:02:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-02-21 00:02:34,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:34,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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) [2022-02-21 00:02:34,781 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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) [2022-02-21 00:02:34,782 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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) [2022-02-21 00:02:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:34,784 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2022-02-21 00:02:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 173 transitions. [2022-02-21 00:02:34,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:34,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:34,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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 96 states. [2022-02-21 00:02:34,785 INFO L87 Difference]: Start difference. First operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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 96 states. [2022-02-21 00:02:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:34,787 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2022-02-21 00:02:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 173 transitions. [2022-02-21 00:02:34,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:34,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:34,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:34,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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) [2022-02-21 00:02:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2022-02-21 00:02:34,790 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 21 [2022-02-21 00:02:34,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:34,790 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2022-02-21 00:02:34,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2022-02-21 00:02:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:34,790 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:34,791 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] [2022-02-21 00:02:34,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-21 00:02:34,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:02:34,997 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash -795397331, now seen corresponding path program 1 times [2022-02-21 00:02:34,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:02:34,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275367847] [2022-02-21 00:02:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:34,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:02:34,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:02:34,999 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) [2022-02-21 00:02:35,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-21 00:02:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:35,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 00:02:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:35,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:35,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {1785#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1785#true} is VALID [2022-02-21 00:02:35,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {1785#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {1785#true} is VALID [2022-02-21 00:02:35,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {1785#true} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {1785#true} is VALID [2022-02-21 00:02:35,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {1785#true} assume !(0bv32 == main_~cond~0#1);main_~lk1~0#1 := 0bv32;main_~lk2~0#1 := 0bv32;main_~lk3~0#1 := 0bv32;main_~lk4~0#1 := 0bv32;main_~lk5~0#1 := 0bv32;main_~lk6~0#1 := 0bv32;main_~lk7~0#1 := 0bv32;main_~lk8~0#1 := 0bv32;main_~lk9~0#1 := 0bv32;main_~lk10~0#1 := 0bv32;main_~lk11~0#1 := 0bv32;main_~lk12~0#1 := 0bv32;main_~lk13~0#1 := 0bv32;main_~lk14~0#1 := 0bv32; {1785#true} is VALID [2022-02-21 00:02:35,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {1785#true} assume !(0bv32 != main_~p1~0#1); {1785#true} is VALID [2022-02-21 00:02:35,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {1785#true} assume 0bv32 != main_~p2~0#1;main_~lk2~0#1 := 1bv32; {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume !(0bv32 != main_~p3~0#1); {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume 0bv32 != main_~p4~0#1;main_~lk4~0#1 := 1bv32; {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume 0bv32 != main_~p5~0#1;main_~lk5~0#1 := 1bv32; {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume 0bv32 != main_~p6~0#1;main_~lk6~0#1 := 1bv32; {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume 0bv32 != main_~p7~0#1;main_~lk7~0#1 := 1bv32; {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume 0bv32 != main_~p8~0#1;main_~lk8~0#1 := 1bv32; {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume 0bv32 != main_~p9~0#1;main_~lk9~0#1 := 1bv32; {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume 0bv32 != main_~p10~0#1;main_~lk10~0#1 := 1bv32; {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume !(0bv32 != main_~p11~0#1); {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume 0bv32 != main_~p12~0#1;main_~lk12~0#1 := 1bv32; {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume 0bv32 != main_~p13~0#1;main_~lk13~0#1 := 1bv32; {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume 0bv32 != main_~p14~0#1;main_~lk14~0#1 := 1bv32; {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume !(0bv32 != main_~p1~0#1); {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} is VALID [2022-02-21 00:02:35,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {1805#(not (= |ULTIMATE.start_main_~p2~0#1| (_ bv0 32)))} assume !(0bv32 != main_~p2~0#1); {1786#false} is VALID [2022-02-21 00:02:35,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {1786#false} assume !false; {1786#false} is VALID [2022-02-21 00:02:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:35,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:02:35,089 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:02:35,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275367847] [2022-02-21 00:02:35,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275367847] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:35,089 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:35,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:35,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594793255] [2022-02-21 00:02:35,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:35,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:35,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:35,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:35,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:35,106 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:02:35,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:35,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:35,107 INFO L87 Difference]: Start difference. First operand 94 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,183 INFO L93 Difference]: Finished difference Result 127 states and 228 transitions. [2022-02-21 00:02:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:35,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-21 00:02:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-02-21 00:02:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-02-21 00:02:35,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 124 transitions. [2022-02-21 00:02:35,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,267 INFO L225 Difference]: With dead ends: 127 [2022-02-21 00:02:35,267 INFO L226 Difference]: Without dead ends: 127 [2022-02-21 00:02:35,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:35,268 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 70 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:35,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-21 00:02:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-02-21 00:02:35,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:35,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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) [2022-02-21 00:02:35,273 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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) [2022-02-21 00:02:35,273 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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) [2022-02-21 00:02:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,276 INFO L93 Difference]: Finished difference Result 127 states and 228 transitions. [2022-02-21 00:02:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 228 transitions. [2022-02-21 00:02:35,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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 127 states. [2022-02-21 00:02:35,277 INFO L87 Difference]: Start difference. First operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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 127 states. [2022-02-21 00:02:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,279 INFO L93 Difference]: Finished difference Result 127 states and 228 transitions. [2022-02-21 00:02:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 228 transitions. [2022-02-21 00:02:35,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:35,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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) [2022-02-21 00:02:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 227 transitions. [2022-02-21 00:02:35,282 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 227 transitions. Word has length 21 [2022-02-21 00:02:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:35,282 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 227 transitions. [2022-02-21 00:02:35,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-02-21 00:02:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 227 transitions. [2022-02-21 00:02:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:35,283 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:35,283 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] [2022-02-21 00:02:35,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:35,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:02:35,507 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:35,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:35,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1816465685, now seen corresponding path program 1 times [2022-02-21 00:02:35,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:02:35,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559326767] [2022-02-21 00:02:35,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:35,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:02:35,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:02:35,509 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) [2022-02-21 00:02:35,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-21 00:02:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:02:35,548 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 00:02:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:02:35,603 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-21 00:02:35,603 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 00:02:35,604 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-02-21 00:02:35,605 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-02-21 00:02:35,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-21 00:02:35,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:02:35,814 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:35,817 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:02:35,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:02:35 BoogieIcfgContainer [2022-02-21 00:02:35,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:02:35,869 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:02:35,869 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:02:35,869 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:02:35,870 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:31" (3/4) ... [2022-02-21 00:02:35,871 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 00:02:35,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:02:35,872 INFO L158 Benchmark]: Toolchain (without parser) took 4901.55ms. Allocated memory was 56.6MB in the beginning and 100.7MB in the end (delta: 44.0MB). Free memory was 34.7MB in the beginning and 77.7MB in the end (delta: -43.0MB). Peak memory consumption was 33.8kB. Max. memory is 16.1GB. [2022-02-21 00:02:35,872 INFO L158 Benchmark]: CDTParser took 6.88ms. Allocated memory is still 56.6MB. Free memory was 37.7MB in the beginning and 37.7MB in the end (delta: 46.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:35,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.66ms. Allocated memory was 56.6MB in the beginning and 81.8MB in the end (delta: 25.2MB). Free memory was 34.5MB in the beginning and 63.3MB in the end (delta: -28.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-02-21 00:02:35,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.99ms. Allocated memory is still 81.8MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:02:35,873 INFO L158 Benchmark]: Boogie Preprocessor took 47.21ms. Allocated memory is still 81.8MB. Free memory was 61.2MB in the beginning and 59.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:35,873 INFO L158 Benchmark]: RCFGBuilder took 423.20ms. Allocated memory is still 81.8MB. Free memory was 59.6MB in the beginning and 45.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 00:02:35,874 INFO L158 Benchmark]: TraceAbstraction took 4046.15ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 45.5MB in the beginning and 78.7MB in the end (delta: -33.2MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2022-02-21 00:02:35,874 INFO L158 Benchmark]: Witness Printer took 2.45ms. Allocated memory is still 100.7MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:35,875 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 6.88ms. Allocated memory is still 56.6MB. Free memory was 37.7MB in the beginning and 37.7MB in the end (delta: 46.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.66ms. Allocated memory was 56.6MB in the beginning and 81.8MB in the end (delta: 25.2MB). Free memory was 34.5MB in the beginning and 63.3MB in the end (delta: -28.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.99ms. Allocated memory is still 81.8MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.21ms. Allocated memory is still 81.8MB. Free memory was 61.2MB in the beginning and 59.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 423.20ms. Allocated memory is still 81.8MB. Free memory was 59.6MB in the beginning and 45.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4046.15ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 45.5MB in the beginning and 78.7MB in the end (delta: -33.2MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * Witness Printer took 2.45ms. Allocated memory is still 100.7MB. Free memory is still 78.7MB. 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: 219]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 219. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L88] COND FALSE !(p1 != 0) VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L92] COND FALSE !(p2 != 0) VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L96] COND FALSE !(p3 != 0) VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L128] COND FALSE !(p11 != 0) VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L146] COND FALSE !(p1 != 0) VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L151] COND FALSE !(p2 != 0) VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L219] reach_error() VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] - UnprovableResult [Line: 6]: 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, 53 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 906 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 624 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=6, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 275 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 [2022-02-21 00:02:35,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample